Problem D. Integer Partition
时间限制 1000 ms
内存限制 32 MB
Given n, k, calculate the number of different (unordered) partitions of n such that no part is repeated k or more times.
输入数据
输出数据
T lines, each line contains answer to the responding test case.
Since the numbers can be very large, you should output them modulo 10
9+7.
样例输入
样例输出
$ Mathjax font initiator $