哥的笑百度不到

摘要： Robot MotionTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5038Accepted Submission(s): 2335Problem DescriptionA robot has been programmed to follow the instructions in its path. Instructions for the next direction the robot is to ... 阅读全文

摘要： Sum It UpTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2983Accepted Submission(s): 1494Problem DescriptionGiven a specified total t and a list of n integers, find all distinct sums using numbers from the list that add up to t. Fo... 阅读全文

摘要： Prime Ring ProblemTime Limit: 4000/2000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 19946Accepted Submission(s): 8935Problem DescriptionA ring is compose of n circles as shown in diagram. Put natural number 1, 2, ..., n into each circle separately, and the sum of nu 阅读全文

摘要： ZipperTime Limit:1000MSMemory Limit:65536KTotal Submissions:14425Accepted:5110DescriptionGiven three strings, you are to determine whether the third string can be formed by combining the characters in the first two strings. The first two strings can be mixed ... 阅读全文

摘要： Oil DepositsTime Limit:2 Seconds Memory Limit:65536 KBThe GeoSurvComp geologic survey company is responsible for detecting underground oil deposits. GeoSurvComp works with one large rectangular region of land at a time, and creates a grid that divides the land into numerous square plots. It then ana 阅读全文

摘要： Tempter of the BoneTime Limit:2 Seconds Memory Limit:65536 KBThe doggie found a bone in an ancient maze, which fascinated him a lot. However, when he picked it up, the maze began to shake, and the doggie could feel the ground sinking. He realized that the bone was a trap, and he tried desperately to 阅读全文

摘要： ArbitrageTime Limit:2 Seconds Memory Limit:65536 KBArbitrage is the use of discrepancies in currency exchange rates to transform one unit of a currency into more than one unit of the same currency. For example, suppose that 1 US Dollar buys 0.5 British pound, 1 British pound buys 10.0 French francs, 阅读全文

摘要： #include#include#include#include#includeusing namespace std;const int inf = 1000000000;const int maxn = 1010;int edge[maxn][maxn];int s[maxn],dist[maxn],i,j,n;struct node{ int t ; char front[5],back[5];}dict[maxn];void dijkstra(){ for(i=0;i<n;i++) { dist[i] = edge[0][i]; s[i] ... 阅读全文

摘要： A very hard mathematic problemTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 2680Accepted Submission(s): 775 Problem Description Haoren is very good at solving mathematic problems. Today he is working a problem like this: Find three positive i... 阅读全文

摘要： 5月5号那是个不平凡的日子,说到这天就想到去年刚上大学的时候老师给我们看的那些关于acm省赛和全国赛师兄们的照片,心中就一直谋生着一种自己也要成为他们那样的冲动,呵呵,上天不负有心人啊, 奋斗了一年的时间,终于可以实现了,终于可以这代表学校参加广东acm省赛(广东是全国竞争最大的). 8.30分坐... 阅读全文