摘要:Pick-up sticksTime Limit: 3000MSMemory Limit: 65536KTotal Submissions: 11043Accepted: 4119DescriptionStan has n sticks of various length. He throws th...
阅读全文
摘要:Space AntTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 3661Accepted: 2281DescriptionThe most exciting space discovery occurred at the end o...
阅读全文
摘要:AreaTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 16894Accepted: 4698DescriptionYou are going to compute the area of a special kind of poly...
阅读全文
摘要:SegmentsTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 10921Accepted: 3422DescriptionGiven n segments in the two dimensional space, write a ...
阅读全文
摘要:Intersecting LinesTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 12421Accepted: 5548DescriptionWe all know that a pair of distinct points on...
阅读全文
摘要:Toy StorageTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 4588Accepted: 2718DescriptionMom and dad have a problem: their child, Reza, never ...
阅读全文
摘要:TOYSTime Limit: 2000MSMemory Limit: 65536KTotal Submissions: 12015Accepted: 5792DescriptionCalculate the number of toys that land in each bin of a par...
阅读全文
摘要:1.多边形面积计算1 double S(Point p[],int n) 2 { 3 double ans = 0; 4 p[n] = p[0]; 5 for(int i=1;i0) return 1; 6 ...
阅读全文