uestc1133菲波拉契数制

菲波拉契数制

Input

Output

Sample input and output

6
1
2
3
4
5
13

1
1
2
1
2
3

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<queue>
#include<list>
#include<vector>
using namespace std;
const int maxn=50;
long long F[maxn],dp[100010];
void init(){
F[0]=F[1]=1;
for(int i=2;i<maxn;++i){
F[i]=F[i-1]+F[i-2];
}
dp[0]=1;
for(long long i=1;i<maxn;++i){
for(long long j=100000;j>=F[i];--j){
dp[j]+=dp[j-F[i]];
}
}
}
int main()
{
init();
long long i,j,k,n,t;
scanf("%lld",&t);
while(t--){
scanf("%lld",&n);
printf("%lld\n",dp
);
}
return 0;
}