摘要：
Long Long MessageTime Limit: 4000MSMemory Limit: 131072KTotal Submissions: 22564Accepted: 9255Case Time Limit: 1000MSDescriptionThe little cat is majo... 阅读全文
摘要：
Balanced LineupTime Limit: 5000MSMemory Limit: 65536KTotal Submissions: 36864Accepted: 17263Case Time Limit: 2000MSDescrip... 阅读全文
摘要：
Keywords SearchTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 25356Accepted Submission(s): 8280 ... 阅读全文
摘要：
Find the ClonesTime Limit:5000MSMemory Limit:65536KTotal Submissions:6365Accepted:2375DescriptionDoubleville, a small town in Texas, was attacked by t... 阅读全文
摘要：
全文检索Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1048Accepted Submission(s): 324Problem Descrip... 阅读全文
摘要：
Problem DescriptionGiven a list of phone numbers, determine if it is consistent in the sense that no number is the prefix of another. Let’s say the ph... 阅读全文
摘要：
Problem DescriptionClairewd is a member of FBI. After several years concealing in BUPT, she intercepted some important messages and she was preparing ... 阅读全文
摘要：
Problem DescriptionCC always becomes very depressed at the end of this month, he has checked his credit card yesterday, without any surprise, there ar... 阅读全文
摘要：
Number SequenceTime Limit: 10000/5000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 12326Accepted Submission(s): 5627P... 阅读全文
摘要：
1 // KMP 2 3 void get_next(char s[],int next[]) 4 { 5 int i,j; 6 i=1;j=0; 7 next[1]=0; 8 int len=strlen(s); 9 while(ilen2)42 ... 阅读全文