小磊's blog

Knight Moves                         Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)                         Total Submission(s): 3763 Accepted Submission(s): 2344

Dungeon MasterTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 12715 Accepted: 4930DescriptionYou are trapped in a 3D dungeon and need to find the quickest

Catch That CowTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 33812 Accepted: 10419DescriptionFarmer John has been informed of the location of a fugitiv

Problem BTime Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 15 Accepted Submission(s) : 0Problem DescriptionAngel was caught by the MOLIGPY! He

Battle CityTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 6496 Accepted: 2176DescriptionMany of us had played the game "Battle city" in our childhood,

吝啬的国度时间限制：1000 ms  |  内存限制：65535 KB难度：3描述在一个吝啬的国度里有N个城市，这N个城市间只有N-1条路把这个N个城市连接起来。现在，Tom在第S号城市，他有张该国地图，他想知道如果自己要去参观第T号城市，必须经过的前一个城市是几号城市（假设你不走重复的路）。输入第一行输入一个整数M表示测试数据共有M(1每组