Quite recently a creative student Lesha had a lecture on trees. After the lecture Lesha was inspired and came up with the tree of his own which he called a k-tree.
A k-tree is an infinite rooted tree where:
- each vertex has exactly k children;
- each edge has some weight;
- if we look at the edges that goes from some vertex to its children (exactly k edges), then their weights will equal 1, 2, 3, ..., k.
The picture below shows a part of a 3-tree.
Help Dima find an answer to his question. As the number of ways can be rather large, print it modulo 1000000007 (109 + 7).
A single line contains three space-separated integers: n, k and d (1 ≤ n, k ≤ 100; 1 ≤ d ≤ k).
Print a single integer — the answer to the problem modulo 1000000007 (109 + 7).
3 3 2
3
3 3 3
1
4 3 2
6
4 5 2
7
题意:给出K-Tree定义,每个结点都有恰好K个孩子,这棵树无限增长。每个节点到它K个孩子的K条边的权重刚好是1,2,3...,K。
现在问有多少条路径,使得从根节点出发到达某个结点,经过的边权重之和恰好为n,并且经过的边至少有一条权重不小于d。
dp[i][0]:表示权值和为i中不包含权值>=d的边。dp[i][j]:表示权值和为i中包含权值>=d的边。
dp[i][0]+=dp[i-j][0] (j<d)
dp[i][1]+=dp[i-j][0] (j>=d)
dp[i][1]+=dp[i-j][1];
#include <iostream>
#include <stdio.h>
#include <string.h>
using namespace std;
long long dp[222][2];
#define MOD 1000000007
int main()
{
int n,k,d;
while (scanf("%d%d%d",&n,&k,&d)!=EOF)
{
memset(dp, 0, sizeof(dp));
dp[0][0]=1;
for (int i=0; i<=n; i++)
{
for (int j=1; j<=k; j++)
{
if(i-j>=0)
{
if(j<d)
{
dp[i][0]+=dp[i-j][0];
}
else
{
dp[i][1]+=dp[i-j][0];
}
dp[i][1]+=dp[i-j][1];
dp[i][0]%=MOD;
dp[i][1]%=MOD;
}
}
}
printf("%lld\n",dp[n][1]);
}
return 0;
}