摘要:
Regular PolygonTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65768/65768 K (Java/Others) Total Submission(s): 2203Accepted Submission(s): 682Problem DescriptionIn a 2_D plane, there is a point strictly in a regular polygon with N sides. If you are given the distances between it and N vertexes 阅读全文
摘要:
Rolling HongshuTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65768/65768 K (Java/Others) Total Submission(s): 1230Accepted Submission(s): 367Problem DescriptionTo see his girl friend, sweet potato has to go over thousands of mountains. What make things worse, many bitter potatoes lives in thes 阅读全文
摘要:
GraphTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65768/65768 K (Java/Others) Total Submission(s): 950Accepted Submission(s): 505Problem DescriptionEveryone knows how to calculate the shortest path in a directed graph. In fact, the opposite problem is also easy. Given the length of shortest p 阅读全文