XMzhou的专栏

674 - Coin ChangeTime limit: 3.000 seconds  Coin Change Suppose there are 5 types of coins: 50-cent, 25-cent, 10-cent, 5-cent, and 1-cent. We want to make changes with these

Card CollectorTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1948    Accepted Submission(s): 909Special JudgeProblem Description

windy数Time Limit: 1000 ms Memory Limit: 65536 kB Solved: 155 Tried: 1277SubmitStatusBest SolutionBackDescriptionwindy定义了一种windy数。不含前导零且相邻两个数字之差至少为

10465 - Homer SimpsonTime limit: 3.000 secondsReturn of the AztecsProblem C:Homer SimpsonTime Limit: 3 secondsMemory Limit: 32 MBHomer Simpson, a very smart

吉哥系列故事——恨7不成妻Time Limit: 1000/500 MS (Java/Others)    Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 1117    Accepted Submission(s): 336Problem Description　　单身!　　依然单身！

不要62Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 14517    Accepted Submission(s): 4663Problem Description杭州人称那些傻乎乎粘嗒嗒的人为62（音：

D. Bag of micetime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputThe dragon and the princess are arguing abou

Max Sum Plus Plus PlusTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1103    Accepted Submission(s): 550Problem Description给定一个

10003 - Cutting SticksTime limit: 3.000 seconds  Cutting Sticks You have to cut a wood stick into pieces. The most affordable company, The Analog Cutting Machinery, Inc. (A

624 - CDTime limit: 3.000 seconds  CD You have a long drive by car ahead. You have a tape recorder, but unfortunately your best music is on CDs. You need to have it on ta

BloodsuckerTime Limit: 2 Seconds      Memory Limit: 65536 KBIn 0th day, there are n-1 people and 1 bloodsucker. Every day, two and only two of them meet. Nothing will happen if they are of the