Grant Yuan的专栏

Intersection of CubesTime Limit:500MS     Memory Limit:32768KB     64bit IO Format:%lld & %lluSubmitStatusPracticeLightOJ 1211DescriptionYou are given n cubes, each cube is describ

Toy StorageTime Limit: 1000MS  Memory Limit: 65536K Total Submissions: 3953  Accepted: 2334 DescriptionMom and dad have a problem: their child, Reza, never puts his toys away when he is fi

SegmentsTime Limit: 1000MS  Memory Limit: 65536K Total Submissions: 9564  Accepted: 2943 DescriptionGiven n segments in the two dimensional space, write a program, which determines if ther

题目意思：给定四个点，前两个点确定一条直线，后两个点确定一条直线，判断两条直线的位置关系； 思路：         两条直线的位置关系分为三种情况：                1.重合：判断方法：(（p1-q1)^(p2-q1))==0&&(（p1-q2)^(p2-q2))==0                2.平行：判断方法：（p1-p2）.x*(q1-q2).y==(p1

思路：            运用队列存储没有被覆盖的木棍，没加入一个棍子，就要判断一下是否队列中的棍子被覆盖，如果被覆盖，就从队列中删除；           线段交判断方法：跨立实验 Pick-up sticksTime Limit: 3000MS Memory Limit: 65536KTotal Submissions: 9698 Accepted: 3591D

1001 - Opposite TaskPDF (English) Statistics ForumTime Limit: 0.5 second(s) Memory Limit: 32 MBThis problem gives you a flavor the concept of special judge. That means the judge is smart enough

TOYSTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 10425 Accepted: 5002DescriptionCalculate the number of toys that land in each bin of a partitioned toy box. Mom and dad have a