摘要：
Neal is very curious about combinatorial problems, and now here comes a problem about words. Knowingthat Ray has a photographic memory and this may no... 阅读全文
摘要：
ZCC loves cardsTime Limit: 4000/2000 MS (Java/Others)Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 828Accepted Submission(s): 184Probl... 阅读全文
摘要：
JumpTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 478Accepted Submission(s): 205Problem Descript... 阅读全文
摘要：
Turn the pokersTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 676Accepted Submission(s): 231Probl... 阅读全文
摘要：
RatingTime Limit: 10000/5000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 348Accepted Submission(s): 217Special Judge... 阅读全文
摘要：
After doing Ray a great favor to collect sticks for Ray, Poor Neal becomes very hungry. In return for Neal's help, Ray makes a great dinner for Neal. ... 阅读全文
摘要：
It is said that the people of Menggol lived in caves. A tribe's caves were connected to each other with paths. The paths were so designed that there w... 阅读全文
摘要：
Panagola, The Lord of city F likes to parade very much. He always inspects his city in his car and enjoys the welcome of his citizens. City F has a re... 阅读全文
摘要：
DescriptionThere are two strings A and B with equal length. Both strings are made up of lower case letters. Now you have a powerful string painter. Wi... 阅读全文
摘要：
Run Length Encoding(RLE) is a simple form of compression. RLE consists of the process for searching for a repeated runs of a single character in a str... 阅读全文