2013年9月18日

Constructing Roads

摘要： Constructing RoadsTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 11481Accepted Submission(s): 4312Problem DescriptionThere are N villages, which are numbered from 1 to N, and you should build some roads such that every two villages can connect to 阅读全文

posted @ 2013-09-18 19:09 ~Love() 阅读(182) 评论(0) 推荐(0)

Ignatius and the Princess IV

摘要： Ignatius and the Princess IVTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32767 K (Java/Others)Total Submission(s): 13294Accepted Submission(s): 5362Problem Description"OK, you are not too bad, em... But you can never pass the next test." feng5166 says."I will tell you an 阅读全文

posted @ 2013-09-18 16:02 ~Love() 阅读(195) 评论(0) 推荐(0)

Ignatius and the Princess III

摘要： Ignatius and the Princess IIITime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 10312Accepted Submission(s): 7318Problem Description"Well, it seems the first problem is too easy. I will let you know how foolish you are later." feng5166 says. 阅读全文

posted @ 2013-09-18 15:37 ~Love() 阅读(213) 评论(0) 推荐(0)

导航