摘要： A Walk Through the ForestTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3140Accepted Submission(s): 1147Problem DescriptionJimmy experiences a lot of stress at work these days, especially since his accident made working difficult. To relax after a 阅读全文

摘要： Wireless NetworkTime Limit: 10000MSMemory Limit: 65536KTotal Submissions: 12151Accepted: 5129DescriptionAn earthquake takes place in Southeast Asia. The ACM (Asia Cooperated Medical team) have set up a wireless network with the lap computers, but an unexpected aftershock attacked, all computers in t 阅读全文

摘要： Train Problem I时间限制：3000 ms | 内存限制：65535 KB难度：1描述As the new term comes, the Ignatius Train Station is very busy nowadays. A lot of student want to get back to school by train(because the trains in the Ignatius Train Station is the fastest all over the world ^v^). But here comes a problem, there is o 阅读全文

摘要： The SuspectsDescriptionSevere acute respiratory syndrome (SARS), an atypical pneumonia of unknown aetiology, was recognized as a global threat in mid-March 2003. To minimize transmission to others, the best strategy is to separate the suspects from others. In the Not-Spreading-Your-Sickness Universi 阅读全文

摘要： Ubiquitous Religions Time Limit : 10000/5000ms (Java/Other) Memory Limit : 131072/65536K (Java/Other)Total Submission(s) : 2 Accepted Submission(s) : 2Problem DescriptionThere are so many different religions in the world today that it is difficult to keep track of them all. You are interested in... 阅读全文

摘要： Tree RecoveryTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 7819Accepted: 4947DescriptionLittle Valentine liked playing with binary trees very much. Her favorite game was constructing randomly looking binary trees with capital letters in the nodes. This is an example of one of her creation 阅读全文

摘要： 括号配对问题时间限制：3000 ms | 内存限制：65535 KB难度：3描述现在，有一行括号序列，请你检查这行括号是否配对。输入第一行输入一个数N（0<N<=100）,表示有N组测试数据。后面的N行输入多组输入数据，每组输入数据都是一个字符串S(S的长度小于10000，且S不是空串），测试数据组数少于5组。数据保证S中只含有"[","]","(",")"四种字符输出每组输入数据的输出占一行，如果该字符串中所含的括号是配对的，则输出Yes,如果不配对则输出No样例输入3[(])(])([[]()])样 阅读全文

摘要： 还是畅通工程Time Limit: 4000/2000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 13192Accepted Submission(s): 6030Problem Description某省调查乡村交通状况，得到的统计表中列出了任意两村庄间的距离。省政府“畅通工程”的目标是使全省任何两个村庄间都可以实现公路交通（但不一定有直接的公路相连，只要能间接通过公路可达即可），并要求铺设的公路总长度为最小。请计算最小的公路总长度。Input测试输入包含若干测试用例。每个测试用 阅读全文

摘要： 又一版 A+Bhttp://acm.hdu.edu.cn/showproblem.php?pid=1877View Code 1 #include<iostream> 2 using namespace std; 3 4 void change(int m,int a) 5 { 6 int s[20]={0}; 7 int i=0; 8 while(a) 9 {10 s[i++]=a%m;11 a=a/m;12 }13 while(i)14 cout<<s[--i];15 cout<<e... 阅读全文

摘要： 吃糖果Time Limit: 6000/3000 MS (Java/Others)Memory Limit: 65535/32768 K (Java/OthersTotal Submission(s): 10834Accepted Submission(s): 3130Problem DescriptionHOHO，终于从Speakless手上赢走了所有的糖果，是Gardon吃糖果时有个特殊的癖好，就是不喜欢将一样的糖果放在一起吃，喜欢先吃一种，下一次吃另一种，这样；可是Gardon不知道是否存在一种吃糖果的顺序使得他能把所有糖果都吃完？请你写个... 阅读全文