连接
摘要: Integer PartitionTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 169Accepted Submission(s): 79 Problem DescriptionGiven n, k, calculate the number of different (unordered) partitions of n such that no part is repeated k or more times.InputFirst li 阅读全文
posted @ 2013-08-09 20:08 朱群喜_QQ囍_海疯习习 阅读(512) 评论(0) 推荐(0) 编辑
Map