摘要：
Intersecting LinesTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 7341Accepted: 3381DescriptionWe all know that a pair of distinct points on a plane defines a line and that a pair of lines on a plane will intersect in one of three ways: 1) no intersection because they are parallel, 2) inter 阅读全文
摘要：
SegmentsTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 6615Accepted: 1981DescriptionGiven n segments in the two dimensional space, write a program, which determines if there exists a line such that after projecting these segments on it, all projected segments have at least one point in com 阅读全文
摘要：
Toy StorageTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 2764Accepted: 1564DescriptionMom and dad have a problem: their child, Reza, never puts his toys away when he is finished playing with them. They gave Reza a rectangular box to put his toys in. Unfortunately, Reza is rebellious and o 阅读全文
摘要：
TOYSTime Limit: 2000MSMemory Limit: 65536KTotal Submissions: 7630Accepted: 3628DescriptionCalculate the number of toys that land in each bin of a partitioned toy box. Mom and dad have a problem - their child John never puts his toys away when he is finished playing with them. They gave John a rectan 阅读全文