摘要： Kadj SquaresTime Limit:2000MSMemory Limit:65536KTotal Submissions:2132Accepted:843DescriptionIn this problem, you are given a sequenceS1,S2, ...,Snof squares of different sizes. The sides of the squares are integer numbers. We locate the squares on the positivex-yquarter of the plane, such that thei 阅读全文

摘要： Space AntTime Limit:1000MSMemory Limit:10000KTotal Submissions:2489Accepted:1567DescriptionThe most exciting space discovery occurred at the end of the 20th century. In 1999, scientists traced down an ant-like creature in the planet Y1999 and called it M11. It has only one eye on the left side of it 阅读全文

摘要： IntersectionTime Limit:1000MSMemory Limit:10000KTotal Submissions:9996Accepted:2632DescriptionYou are to write a program that has to decide whether a given line segment intersects a given rectangle.An example:line: start point: (4,9)end point: (11,2)rectangle: left-top: (1,5)right-bottom: (7,1)Figur 阅读全文

摘要： Treasure HuntTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 4797Accepted: 1998DescriptionArcheologists from the Antiquities and Curios Museum (ACM) have flown to Egypt to examine the great pyramid of Key-Ops. Using state-of-the-art technology they are able to determine that the lower floor 阅读全文

摘要： Pick-up sticksTime Limit: 3000MSMemory Limit: 65536KTotal Submissions: 7699Accepted: 2843DescriptionStan has n sticks of various length. He throws them one at a time on the floor in a random way. After finishing throwing, Stan tries to find the top sticks, that is these sticks such that there is no 阅读全文

摘要： The DoorsTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 5210Accepted: 2124DescriptionYou are to find the length of the shortest path through a chamber containing obstructing walls. The chamber will always have sides at x = 0, x = 10, y = 0, and y = 10. The initial and final points of the p 阅读全文

摘要： Intersecting LinesTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 8342Accepted: 3789DescriptionWe 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: 7739Accepted: 2316DescriptionGiven 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: 3146Accepted: 1798DescriptionMom 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: 8661Accepted: 4114DescriptionCalculate 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 阅读全文