http://codeforces.com/problemset/problem/431/C
题意:一颗完全k叉树,边权1~k;问路径权和为n且至少包含一条路权不小于d的路劲有多少;
思路:dp;dp[i][j]表示总和i,第一维类似完全背包, 第二维判断是否满足d条件;
#include<algorithm>
#include<set>
#include<vector>
#include<queue>
#include<cmath>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<set>
#include<vector>
#include<queue>
#include<cmath>
#include<cstring>
#include<sstream>
#include<cstdio>
#include<ctime>
#include<map>
#include<stack>
#include<string>
using namespace std;
#define sfi(i) scanf("%d",&i)
#define pri(i) printf("%d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define eps 1e-6
#define PI acos(-1)
#define lowbit(x) ((x)&(-x))
#define zero(x) (((x)>0?(x):-(x))<eps)
#define fl() printf("flag\n")
ll gcd(ll a,ll b){while(b^=a^=b^=a%=b);return a;}
const int maxn=1e5+9;
const int mod=1e9+7;
template <class T>
inline void sc(T &ret)
{
char c;
ret = 0;
while ((c = getchar()) < '0' || c > '9');
while (c >= '0' && c <= '9')
{
ret = ret * 10 + (c - '0'), c = getchar();
}
}
ll dp[1009][2];
int main()
{
int n,k,d;
while(cin>>n>>k>>d)
{
mem(dp,0);
dp[0][0]=1;
for(int i=1;i<=n;i++)
{
for(int j=1;j<=k;j++)
{
if(i<j) break;
if(j<d)
{
dp[i][0]+=dp[i-j][0];
dp[i][0]%=mod;
dp[i][1]+=dp[i-j][1];
dp[i][1]%=mod;
}
else
{
dp[i][1]+=dp[i-j][0];
dp[i][1]%=mod;
dp[i][1]+=dp[i-j][1];
dp[i][1]%=mod;
}
}
}
cout<<dp[n][1]<<endl;
}
return 0;
}