摘要：
Catch That CowTime Limit : 4000/2000ms (Java/Other)Memory Limit : 131072/65536K (Java/Other)Total Submission(s) : 113Accepted Submission(s) : 46Proble... 阅读全文
摘要：
Zipper Problem Description Given three strings, you are to determine whether the third string can be formed by combining the characters in the first t 阅读全文
摘要：
Fire NetTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7944Accepted Submission(s): 4534Problem De... 阅读全文
摘要：
Walking AntTime Limit: 2 Seconds Memory Limit: 65536 KBAnts are quite diligent. They sometimes build their nests beneath flagstones.Here, an ant is w... 阅读全文
摘要：
1 #include 2 #include 3 #include 4 using namespace std; 5 int step,t; 6 int visit[25]; 7 int map[25]; 8 int pre[26]; 9 int disx[4]={0,1,0,-1};10 int ... 阅读全文
摘要：
Exchange CardsTime Limit:2 Seconds Memory Limit:65536 KBAs a basketball fan, Mike is also fond of collecting basketball player cards. But as a student... 阅读全文
摘要：
Dungeon Master Problem Description You are trapped in a 3D dungeon and need to find the quickest way out! The dungeon is composed of unit cubes which 阅读全文
摘要：
RescueTime Limit : 2000/1000ms (Java/Other)Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 24Accepted Submission(s) : 11Problem Descript... 阅读全文
摘要：
1 #include 2 int fun(int a,int b){ 3 int ans=1; 4 while(b){ 5 if(b&1)ans*=a; 6 a*=a; 7 b>>=1; 8 } 9 r... 阅读全文