HDU 4651&&HDU 4658 五边形数定理

最新推荐文章于 2020-02-05 22:17:29 发布

2997ms

最新推荐文章于 2020-02-05 22:17:29 发布

阅读量436

点赞数

分类专栏： HDU 数学-简单数学应用

本文链接：https://blog.csdn.net/u010885899/article/details/51253915

版权

本文探讨了五边形数定理在HDU 4651和HDU 4658两个问题中的应用，涉及正整数分解和Integer Partition。通过欧拉函数和分割函数的关系，得出关于分割数的递推公式，并提供了相应的代码实现。

摘要由CSDN通过智能技术生成

Partition

Time Limit: 6000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 1079 Accepted Submission(s): 630

Problem Description

How many ways can the numbers 1 to 15 be added together to make 15? The technical term for what you are asking is the "number of partition" which is often called P(n). A partition of n is a collection of positive integers (not necessarily distinct) whose sum equals n.

Now, I will give you a number n, and please tell me P(n) mod 1000000007.

Input

The first line contains a number T(1 ≤ T ≤ 100), which is the number of the case number. The next T lines, each line contains a number n(1 ≤ n ≤ 10 ⁵) you need to consider.

Output

For each n, output P(n) in a single line.

Sample Input