摘要：
B. Mr. Kitayuta's Colorful Graphtime limit per test1 secondMr. Kitayuta has just bought an undirected graph consisting of n vertices and m edges. The ... 阅读全文
摘要：
Columbus’s bargainTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1721Accepted Submission(s): 431P... 阅读全文
摘要：
DescriptionWhen a radio station is broadcasting over a very large area, repeaters are used to retransmit the signal so that every receiver has a stron... 阅读全文
摘要：
Time Limit: 2000/2000 MS (Java/Others)Memory Limit: 512000/512000 K (Java/Others)Total Submission(s): 0Accepted Submission(s): 0Problem Description ... 阅读全文
摘要：
A very hard Aoshu probleProblem DescriptionAoshu is very popular among primary school students. It is mathematics, but much harder than ordinary mathe... 阅读全文
摘要：
Ping pongTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4094Accepted Submission(s): 1522Problem D... 阅读全文
摘要：
Destroying the bus stationsTime Limit:1000MSMemory Limit:65536KTotal Submissions:1832Accepted:595DescriptionGabiluso is one of the greatest spies in h... 阅读全文
摘要：
Josephina and RPGTime Limit: 4000/2000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 929Accepted Submission(s): 265Spe... 阅读全文
摘要：
1 #include 2 #include 3 #include 4 #include 5 #include 6 #include 7 #include 8 #include 9 #include10 #include11 using namespace std;12 const int inf=... 阅读全文
摘要：
http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemId=203SwordfishTime Limit: 2 Seconds Memory Limit: 65536 KBThere exists a world within our wo... 阅读全文