Farmer John commanded his cows to search for different sets of numbers that sum to a given number. The cows use only numbers that are an integer power of 2. Here are the possible sets of numbers that sum to 7:
1) 1+1+1+1+1+1+1
2) 1+1+1+1+1+2
3) 1+1+1+2+2
4) 1+1+1+4
5) 1+2+2+2
6) 1+2+4
Help FJ count all possible representations for a given integer N (1 <= N <= 1,000,000).
1) 1+1+1+1+1+1+1
2) 1+1+1+1+1+2
3) 1+1+1+2+2
4) 1+1+1+4
5) 1+2+2+2
6) 1+2+4
Help FJ count all possible representations for a given integer N (1 <= N <= 1,000,000).
A single line with a single integer, N.
The number of ways to represent N as the indicated sum. Due to the potential huge size of this number, print only last 9 digits (in base 10 representation).
7
6
n=1,输出1;
n=2或3,输出2;
n=4或5,输出4;
n=6或7,输出6;
n=8或9,输出10;
规律题,多写几个找规律;
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <vector>
typedef long long ll;
using namespace std;
int dp[1000000+5];
int main()
{
int n;
cin>>n;
dp[1]=1;
dp[2]=2;
for(int i=3;i<=n;i++){
if(i%2==1)
dp[i]=dp[i-1];
else{
dp[i]=(dp[i/2]+dp[i-2])%1000000000;
}
}
cout<<dp[n]<<endl;
return 0;
}