POJ - 2229这道题可以用找规律来做,要是用dp做的话,有点卡时间,使用完全背包进行取模运算时不能每次都取否则会超时。
//#include <bits/stdc++.h>
#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstring>
#define me(x,y) memset(x,y,sizeof(x))
#define sd(x) scanf("%d",&x)
#define slld(x) scanf("%lld",&x)
#define ss(x) scanf("%s",x)
#define sf(x) scanf("%f",&x)
#define slf(x) scanf("%lf",&x)
#define pd(x) printf("%d\n",x)
#define plld(x) printf("%lld\n",x)
#define ps(x) printf("%s",x)
#define max(x,y) (x>=y?x:y)
#define min(x,y) (x<y?x:y)
#define sum(x,y) (x+y)
#define INF 0x3f3f3f3f
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const int maxn = 1000001;
const int mod = 1e9;
ll n,c;
ll dp[maxn];
ll a[300];
int main()
{
sd(c);
me(dp,0);
dp[0]=1;
a[0]=1;
for(int i=0;i<20;i++) {
if(i)a[i]=a[i-1]*2;
if(a[i]>c)break;
for(int j=a[i];j<=c;j++) {
dp[j]=dp[j]+dp[j-a[i]];
if(dp[j]>mod)dp[j]%=mod;
}
}
cout<<dp[c]%mod<<endl;
return 0;
}