摘要： Integer PartitionTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 22Accepted Submission(s): 15Problem DescriptionGiven n, k, calculate the number of different (unordered) partitions of n such that no part is repeated k or more times. InputFirst line 阅读全文

摘要： UnshuffleTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 148Accepted Submission(s): 43Special JudgeProblem DescriptionA shuffle of two strings is formed by interspersing the characters into a new string, keeping the characters of each string in ord 阅读全文

摘要： TriangulationTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 96Accepted Submission(s): 29Problem DescriptionThere are n points in a plane, and they form a convex set. No, you are wrong. This is not a computational geometry problem. Carol and Dave a 阅读全文

摘要： MU PuzzleTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 134Accepted Submission(s): 71Problem DescriptionSuppose there are the symbols M, I, and U which can be combined to produce strings of symbols called "words". We start with one word 阅读全文

摘要： Cut PiecesTime Limit: 4000/2000 MS (Java/Others)Memory Limit: 131072/65536 K (Java/Others)Total Submission(s): 133Accepted Submission(s): 62Problem DescriptionSuppose we have a sequence of n blocks. Then we paint the blocks. Each block should be painted a single color and block i can have color 1 to 阅读全文