id
int32 0
32.5k
| code
stringlengths 95
8.4k
| label
stringclasses 65
values |
|---|---|---|
30,300 | int f(int n);
int main(int argc, char* argv[])
{
int m,p,i;
scanf("%d",&p);
for(i=0;i<p;i++)
{
scanf("%d",&m);
printf("%d\n",f(m));
}
return 0;
}
int f(int n)
{
int result;
if(n==1||n==2)
result=1;
else
result=f(n-1)+f(n-2);
return result;
} | 61 |
30,301 | main(){
int n,i,a[100],b[100];
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d",&a[i]);
}
int s=2;
b[0]=1;
b[1]=1;
for(i=0;i<n;i++){
if(a[i]<=2)
printf("1\n");
else{
for(s=2;s<a[i];s++){
int j=s-1;
int k=s-2;
b[s]=b[j]+b[k];
}
int m=a[i]-1;
printf("%d\n",b[m]);
}
}
} | 61 |
30,302 | main()
{
int a[10000];
int n,i,b;
scanf("%d",&n);
for(i=0;i<n;i++)
{ int sum=0;
scanf("%d",&b);
sum=fei(b);
printf("%d\n",sum);
}
}
int fei(int n)
{
if(n==1)
return 1;
if(n==2)
return 1;
return (fei(n-1)+fei(n-2));
} | 61 |
30,303 | int main()
{
int n,i,m,j;
cin>>n;
for(i=1;i<=n;i++)
{
cin>>m;
int a=1,b=1;
if(m>2)
{
for(j=3;j<=m;j++)
{
a=a+b;
b=a-b;
}
cout<<a<<endl;
}
else
cout<<"1"<<endl;
}
return 0;
}
| 61 |
30,304 | int main()
{
int n,a[100],k,q,w,e,i;
cin>>n;
k=0;
while (k<n)//????????
{
cin>>a[k];
k++;
}
i=0;
while (i<n)//???????????
{
q=w=1;
e=0;
k=2;
if (a[i]==1)//?????1,2?,???1 ????????a[i]?
cout<<q<<endl;
else if (a[i]==2)
cout<<w<<endl;
else
{
while (k<a[i])
{
e=q+w;
q=w;
w=e;
k++;
}
cout<<e<<endl;
}
i++;
}
return 0;
}
| 61 |
30,305 | int main(){
int n,a,b=1,c=1,y;
scanf("%d",&n);
for(int j=0;j<n;j++){
scanf("%d",&a);
for(int i=0;i<a;i++){
if(i==0||i==1){
y=1;
}
else{
y=b+c;
c=b;
b=y;
}
}
printf("%d\n",y);
c=1;
b=1;
}
return 0;
} | 61 |
30,306 | int main(){
int a[5000],b[1000];
int i,n,k;
scanf("%d",&k);
a[0]=1;
a[1]=1;
for(i=0;i<1000;i++){
a[i+2]=a[i+1]+a[i];
}
for(i=0;i<k;i++){
scanf("%d",&b[i]);
}
for(i=0;i<k-1;i++){
printf("%d\n",a[b[i]-1]);
}
printf("%d",a[b[k-1]-1]);
return 0;
}
| 61 |
30,307 | int main()
{
int n,a,i,j,sz[100];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a);
if(a==1||a==2)
{
sz[a-1]=1;
}
else
{
for(j=2;j<a;j++)
{
sz[0]=1;
sz[1]=1;
sz[j]=sz[j-2]+sz[j-1];
}
}
printf("%d\n",sz[a-1]);
}
return 0;
}
| 61 |
30,308 |
int dd(int n)
{
int i,z;
if(n==1||n==2)
z=1;
else
z=dd(n-1)+dd(n-2);
return z;
}
int main()
{
int m,i,a,b;
scanf("%d",&m);
for (i=0;i<m;i++)
{
scanf("%d",&a);
printf("%d",dd(a));
if (i<m-1)
printf("\n");
}
} | 61 |
30,309 |
int main(int argc, char* argv[])
{
int n,i,j;
scanf("%d",&n);
int a[1000];
for(i=0;i<n;i++){
scanf("%d",&a[i]);
}
int y[30];
for(i=0;i<n;i++){
for(j=0;j<a[i];j++){
if(j==0){
y[0]=1;
}else if(j==1){
y[1]=1;
}else{
y[j]=y[j-1]+y[j-2];
}
}
printf("%d\n",y[j-1]);
}
return 0;
}
| 61 |
30,310 | int main()
{
int n,maxi;
cin >> n;
int m[n];
maxi = 0;
for (int i = 0; i <= n - 1;i++)
{
cin >> m[i];
maxi = max (m[i],maxi);
}
int a[maxi];
a[0] = 1;
a[1] = 1;
for (int j = 2; j <= maxi - 1; j++)
{
a[j] = a[j - 1] + a[j - 2];
}
for (int k = 0; k <= n - 1; k++)
{
cout << a[m[k] - 1] << endl;
}
return 0;
} | 61 |
30,311 | int main ()
{
int n,m=25,i,j,a[30],b[30];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
b[0]=1;
b[1]=1;
b[2]=2;
for(j=3;j<m;j++)
{
b[j]=b[j-1]+b[j-2];
}
for(i=0;i<n;i++)
{
printf("%d\n",b[a[i]-1]);
}
return 0;
} | 61 |
30,312 | int F(int n);
int main(){
int n,z,i,sz[1000],result;
scanf("%d",&z);
for(i=0;i<z;i++){
scanf("%d",&(sz[i]));
}
for(i=0;i<z;i++){
n=sz[i];
result=F(n);
printf("%d\n",result);
}
return 0;
}
int F(int n){
scanf("%d",&n);
if(n==1){return 1;}
if(n==2){return 1;}
else{return F(n-1)+F(n-2);}
}
| 61 |
30,313 | int main()
{
int a[20],b[10];
int i,j,n;
a[0]=1;
a[1]=1;
for(i=2;i<=19;i++)
{
a[i]=a[i-1]+a[i-2];
}
cin>>n;
for(i=0;i<n;i++)
{
cin>>j;
b[i]=a[j-1];
cout<<b[i]<<endl;
}
return 0;
} // ?????
| 61 |
30,314 | int w(int n);
int main(){
int m,n,sz[100],i;
scanf("%d",&m);
for(i=1;i<=m;i++){
scanf("%d",&n);
printf("%d\n",w(n));
}
return 0;
}
int w(int n){
int i,sz[100];
sz[0]=0;
sz[1]=1;
if(n==0||n==1){
return sz[n];
}else{
for(i=1;i<n+1;i++){
sz[i+1]=sz[i]+sz[i-1];
}
}
return sz[n];
} | 61 |
30,315 | int main(){
int i,j;
int r;
scanf("%d",&r);
int n;
for(j=0;j<r;j++){
scanf("%d",&n);
int sz[10000];
sz[0]=0;
sz[1]=1;
if(n==1){
printf("1\n");
}
if(n>=2){
for(i=2;i<=n;i++){
sz[i]=sz[i-1]+sz[i-2];
}
printf("%d\n",sz[n]);
for(i=2;i<=n;i++){
sz[i]=0;
}
}
}
return 0;
} | 61 |
30,316 | int sum(int m);
int main()
{
int m,n,i,a[100];
scanf("%d",&n);
a[1]=1;a[2]=1;
for(i=1;i<=n;i++)
{
scanf("%d",&m);
printf("%d\n",sum(m));
}
}
int sum(int m)
{
int i,a[100];
for(i=3;i<=21;i++)
{
a[1]=1;a[2]=1;
a[i]=a[i-1]+a[i-2];
}
return a[m];
}
| 61 |
30,317 | //*************************
//* ?????????
//* ?????
//* ???1200012941
//* ???2012?9?24?
//*************************
int digui(int a)
{
if (a == 1)
{
return 1;
}
if (a == 2)
{
return 1;
}
if (a > 2)
{
return digui(a - 1) + digui(a - 2);
}
}
int main()
{
int i, n, a;
cin >> n;
for (i = 0; i < n; i++)
{
cin >> a;
cout << digui(a) << endl << endl;
}
return 0;
}
| 61 |
30,318 | int main()
{
int n,i,j,k,c;
int a[21];
scanf("%d",&n);
for (j=1;j<=n;j++)
{
scanf("%d",&k);
for(i=3;i<=k;i++)
{
a[1]=1;
a[2]=1;
a[i]=a[i-1]+a[i-2];
}
c=a[k];
printf("%d\n",c);
}
getchar();
getchar();
}
| 61 |
30,319 | /*
* Filename:parctice_fibonacciarray.cpp
* Author: Wu Yiming
* Created on: 2011-11-2
* Function: find certain number in Fibonacii array
*/
int main()
{
int n,pos,i;
cin>>n;
int fib[21]={1,1};
while (n)
{
cin>>pos;
for(i=2;i<pos;i++)
fib[i]=fib[i-1]+fib[i-2];
cout<<fib[i-1]<<endl;
n--;
}
return 0;
}
| 61 |
30,320 | int feibo(int n);
int main()
{
int i,n,c,result[1000];
scanf("%d",&c);
for(i=1;i<=c;i++){
scanf("%d",&n);
result[i]=feibo(n);
}
for(i=1;i<=c;i++){
printf("%d\n",result[i]);
}
return 0;
}
int feibo(int n)
{
int a=0;
int b=0;
int result=1;
int i;
for(i=1;i<=n-1;i++){
a=result;
result=result+b;
b=a;
}
return result;
} | 61 |
30,321 |
int main()
{
int n,i,j,k,a[10000],b[30],c[10000];
scanf("%d",&n);
for (i=0;i<n;i++){
scanf("%d",&a[i]);
}
for (i=0;i<n;i++){
for (j=0;j<a[i];j++){
b[0]=1;
b[1]=1;
b[j+2]=b[j]+b[j+1];
c[i]=b[j];
}
}
for (k=0;k<n;k++){
printf("%d\n",c[k]);
}
return 0;
}
| 61 |
30,322 | int f(int n)
{
if(n==1)return 1;
else if(n==2)return 1;
else
{
return f(n-1)+f(n-2);
}
}
int main()
{
int k=0;
int a[k];
cin>>k;
for(int i=0;i<k;i++)
{
cin>>a[i];
}
for(int i=0;i<k;i++)
{
cout<<f(a[i])<<endl;
}
return 0;
} | 61 |
30,323 | int main()
{
int n,i,j;
int a[10000],b[10000];
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&b[i]);
a[0]=1;
a[1]=1;
for(i=0;i<n;i++)
{
for(j=2;j<=b[i]-1;j++)
a[j]=a[j-1]+a[j-2];
printf("%d\n",a[b[i]-1]);
}
getchar();
getchar();
return 0;
}
| 61 |
30,324 | int main()
{ int n;
int a[100],b[100];
int i;
int t;
a[0]=1;
a[1]=1;
scanf("%d",&n);
for(i=0;i<n;i++)
{ scanf("%d",&b[i]);}
for(i=2;i<99;i++)
{ a[i]=a[i-1]+a[i-2];}
for(i=0;i<n;i++)
{ if(b[i]==1||b[i]==2)
{ printf("1\n");}
else
{ t=b[i]-1;
printf("%d\n",a[t]);}}
return 0;
}
| 61 |
30,325 | /*
* ????Fibonacci Sequence.cpp
* ??????
* ????: 2012-11-5
* ??:??????????a??????
*/
int main(){
int n,a[21],Fibonacci[21],i,k;
cin >> n;
for (k=1;k<=n;k++) //????a????a[i]??
cin >> a[k];
Fibonacci[1]=1;
Fibonacci[2]=1;
for(i=3;i<=20;i++)
Fibonacci[i]=Fibonacci[i-1]+Fibonacci[i-2]; //Fibonacci???????????
for (k=1;k<=n;k++)
cout << Fibonacci[a[k]] << endl; //?????????
return 0;
}
| 61 |
30,326 | int main(){
int n,i,j,a[10000]={1,1},sz[10000];
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d",&sz[i]);
}
for(i=0;i<n;i++){
for(j=0;j<sz[i];j++){
a[j+2]=a[j+1]+a[j];
}
printf("%d\n",a[sz[i]-1]);
}
return 0;
} | 61 |
30,327 | int main()
{int n,i,j;
cin>>n;
int a[n];
for(i=0;i<n;i++)
{cin>>a[i];}
int b[20]={0};
for(j=0;j<n;j++)
{b[0]=1;
b[1]=1;
if(a[j]<=2)
cout<<"1"<<endl;
else
{for(i=2;i<a[j];i++)
{b[i]=b[i-1]+b[i-2];}
cout<<b[i-1]<<endl;}}
return 0;
} | 61 |
30,328 | /*
title: ??????
function: ?????????????: ?????????????1????????????2?????
???????a???????????a??????
*/
int main()
{
int f[20]={1,1},i,n,result[20],a;
for (i=2;i<20;i++) //calculate f series
{
f[i]=f[i-2]+f[i-1];
}
cin>>n;
for (i=0;i<n;i++)
{
cin>>a;
result[i]=f[a-1];
}
for (i=0;i<n;i++)
{
cout<<result[i]<<endl;
}
}
| 61 |
30,329 | int main() {
int n,i,j,a[1000],s[1000],b[1000];
scanf("%d",&n);
for (i=0;i<n;i++){
scanf("%d",&a[i]);
}
for(i=0;i<n;i++){
s[i]=0;
b[0]=1;
b[1]=1;
for(j=2;j<a[i];j++){
b[j]=b[j-1]+b[j-2];
}
for(j=0;j<a[i];j++){
s[i]+=b[j];
}
printf("%d\n",b[j-1]);
}
return 0;
}
| 61 |
30,330 | int f(int n)
{
if(n==1)
{
return 1;
}
else if(n==2)
{
return 1;
}
else
{
return(f(n-1)+f(n-2));
}
}
int main()
{
int n=0,a=0;
cin>>n;
for(int i=1;i<=n;i++)
{
cin>>a;
cout<<f(a)<<endl;
}
return 0;
} | 61 |
30,331 | int main(){
int f[20];
f[1]=1;
f[0]=1;
int n;
int a[20];
for(int i=2;i<=19;i++)
f[i]=f[i-1]+f[i-2];
cin>>n;
for(int i=0;i<=n-1;i++)
cin>>a[i];
for(int i=0;i<=n-1;i++)
cout<<f[a[i]-1]<<endl;//????1????
} | 61 |
30,332 | int fibonacci(int n)
{
int x;
if(n==1||n==2){
x=1;
}
else{
x=fibonacci(n-1)+fibonacci(n-2);
}
return x;
}
int main()
{
int n,i,m,a;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d",&a);
m=fibonacci(a);
printf("%d\n",m);
}
return 0;
}
| 61 |
30,333 | long f(int x);
int main()
{
int num,n[10],r;
cin >> num;
for(r=0;r<num;r++) cin >> n[r];
for(r=0;r<num;r++) cout << f(n[r]) << '\n';
return 0;
}
long f(int x)
{
if(x==1||x==2) return 1;
else return f(x-1)+f(x-2);
} | 61 |
30,334 |
int main()
{
int i,n,a,b;
int N[20];
scanf("%d",&n);
for(a=0;a<=n-1;a++)
scanf("%d",&N[a]);
int f[20]={1,1};
for(i=2;i<20;i++)
{
f[i]=f[i-2]+f[i-1];
}
for(a=0;a<=n-1;a++)
{
b=N[a]-1;
printf("%d\n",f[b]);
}
return 0;
}
| 61 |
30,335 | int main(){
int n,a,i,j,k;
int sz[1000];
int x[1000];
scanf("%d",&n);
sz[0]=1;
sz[1]=1;
for(j=0;j<=n-1;j++){
scanf("%d",&a);
if(a>=3){
for(i=0;i<=a-3;i++){
sz[i+2]=sz[i]+sz[i+1];
x[j]=sz[i+2];
}
}else{
x[j]=1;
}
}
for(k=0;k<n;k++){
printf("%d\n",x[k]);
}
return 0;
}
| 61 |
30,336 | int main()
{ int f(int x);
int a[10];
int i,n;
scanf("%d",&n);
for(i=0;i<n;i++)
{scanf("%d",&a[i]);
printf("%d\n",f(a[i]));
}
return 0;
}
int f(int x)
{
int f1=1,f2=1,f3,b,i;
if(x==1||x==2) return(1);
else
{for(i=2;i<x;i++)
{f3=f1+f2;f1=f2;f2=f3;}
b=f3;
return(b);}}
| 61 |
30,337 | int main(){
int n,i,j,a,sz[20],r[100];
sz[0]=0;
sz[1]=1;
scanf("%d",&n);
for(j=0;j<n;j++)
{
scanf("%d",&a);
for(i=2;i<=a;i++)
{sz[i]=sz[i-1]+sz[i-2];}
r[j]=sz[a];
}
for(j=0;j<n;j++)
{if(j==0){printf("%d",r[j]);}
else{printf("\n%d",r[j]);}
}
return 0;
} | 61 |
30,338 |
int fib(int n)
{
int i,s;
if(n==1||n==2)
s=1;
if(n>2)
{
s=fib(n-1)+fib(n-2);
}
return s;
}
int main()
{
int n;
int a[100000];
scanf("%d",&n);
for(int i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
for(int i=0;i<n;i++)
printf("%d\n",fib(a[i]));
getchar();
getchar();
}
| 61 |
30,339 |
int main()
{
int f(int);
int n, i, a;
cin >> n;
for(i = 0; i < n; i++)
{
cin >> a;
a = f(a);
cout << a << endl;
}
return 0;
}
int f(int a)
{
if(a == 1 || a == 2) return 1;
else
{
return f(a - 1) + f(a - 2);
}
}
| 61 |
30,340 | int fun(int n);
main()
{
int n;
scanf("%d",&n);
int num;
for(int i=0;i<n;i++)
{
scanf("%d",&num);
printf("%d\n",fun(num));
}
getchar();
getchar();
}
int fun(int n)
{
if(n==1||n==2) return 1;
else
{
int sum=0;
sum=fun(n-1)+fun(n-2);
return sum;
}
}
| 61 |
30,341 | void xun(int);
int main()
{
int n, a, i;
cin >> n;
for(i = 0; i < n; i++)
{
cin >> a;
xun(a);
}
return 0;
}
void xun(int a)
{
int i, b = 1, c = 1, d;
if(a == 1 || a == 2)
cout << "1" << endl;
else
{
a --;
for(i = 1; i < a; i++)
{
d = b;
b = b + c;
c = d;
}
cout << b << endl;
}
return ;
} | 61 |
30,342 | int main()
{int i,a[20],m,n;
scanf("%d",&n);
a[0]=1;
a[1]=1;
for(i=2;i<20;i++)
a[i]=a[i-1]+a[i-2];
i=0;
while(i<n)
{ scanf("%d",&m);
if(i==n-1)
{printf("%d",a[m-1]);return 0;}
else
printf("%d\n",a[m-1]);
i++;
}
return 0;
} | 61 |
30,343 | int main()
{
int n,x[20],ai,i,j,b;
x[1]=1;
x[2]=1;
for(j=3;j<=20;j++)
x[j]=x[j-1]+x[j-2];
cin>>n;
for(i=1;i<=n;i++){
cin>>ai;
b=x[ai];
cout<<b<<endl;
}
return 0;
}
| 61 |
30,344 | int main()
{
int casenum;
cin >> casenum;
int f[100];
f[0] = 0;
f[1] = 1;
int i;
for(i = 2;i <= 20; i ++)
{
f[i] = f[i-1] + f[i-2];
}
while(casenum--)
{
int a;
cin >> a;
int i,j;
cout<<f[a]<<endl;
}
return 0;
} | 61 |
30,345 | int main()
{
int n,a,i,j;
int c[10000],b[10000];
c[0]=1;c[1]=1;
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%d/n",&a);
b[i-1]=a;
}
for(i=1;i<9999;i++)
{
c[i+1]=c[i]+c[i-1];
}
for(i=0;i<n;i++)
{
j=b[i];
printf("%d\n",c[j-1]);
}
return 0;
}
| 61 |
30,346 | int f(int x)
{
int a[1000]={1,1};
for(int i=2;i<x;i++)
a[i]=a[i-1]+a[i-2];
return a[x-1];
}
int main()
{
int n;
scanf("%d",&n);
int b[1000];
for(int i=0;i<n;i++)
scanf("%d",&b[i]);
for(int i=0;i<n;i++)
printf("%d\n",f(b[i]));
getchar();
getchar();
} | 61 |
30,347 | int main(){
int n,i,k,m,s;
int a[100],sz[100];
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d",&a[i]);
}
for(i=0;i<n;i++){
m=a[i];
sz[0]=1;
sz[1]=1;
if(m==1)
s=1;
if(m==2)
s=1;
if(m!=1&&m!=2){
s=0;
for(k=2;k<a[i];k++){
sz[k]=sz[k-1]+sz[k-2];
s=sz[k];
}
}
printf("%d\n",s);
}
return 0;
}
| 61 |
30,348 | /*
* Fib.cpp
*
* Created on: 2013-10-1
* Author: KEVIN
*/
int fibs[19];//????????????????????
int Fib(int i)
{
if(fibs[i-1]!=0)return fibs[i-1];//????????????
else
{
//?????????????
if(i==1||i==2)
{
fibs[i-1]=1;
return 1;
}
else
{
fibs[i-1]=Fib(i-1)+Fib(i-2);
return fibs[i-1];
}
}
}
int main()
{
for(int i=0;i<=19;i++)fibs[i]=0;//???0
int n;
cin>>n;
while(n)
{
int a;
cin>>a;
cout<<Fib(a)<<endl;
n--;
}
return 0;
} | 61 |
30,349 | /*
* c++practice_026.cpp
* name:??????
* Created on: 2011-11-1
* Author: zhujile
*/
int main(){
int a[21]={1,1},n,i,num[100];
cin>>n;
for (int j=2;j<21;j++)
a[j]=a[j-1]+a[j-2]; //??21????
for (i=0;i<n;i++)
cin>>num[i]; //??????????????
for (i=0;i<n;i++)
cout<<a[num[i]-1]<<endl; //?????
return 0;
} | 61 |
30,350 |
int main()
{
int n,a,i,j,x=1,y=1,z=0;
int b[100];
scanf("%d",&n);
for(i=0;i<n;i++){
x=1;y=1;
scanf("%d",&a);
if(a==1||a==2){
b[i]=1;
}else{
for(j=0;j<a-2;j++){
z=x+y;
x=y;
y=z;
b[i]=z;
}
}
}for(i=0;i<n;i++){
printf("%d\n",b[i]);
}
return 0;
}
| 61 |
30,351 | int main()
{
int a[20];
a[1]=a[2]=1;
int i;
for(i=3;i<=20;i++)
{
a[i]=a[i-1]+a[i-2];
}
int n;
cin>>n;
int b[n];
for(i=1;i<=n;i++)
{
cin>>b[i];
}
for(i=1;i<=n;i++)
{
cout<<a[b[i]]<<endl;
}
}
| 61 |
30,352 | int F(int x){
int sz[100];
int i;
sz[0]=1;
sz[1]=1;
for(i=2;i<100;i++){
sz[i]=sz[i-1]+sz[i-2];
}
return sz[x-1];
}
int main(){
int n;
int i;
int sa[100];
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d",&sa[i]);
printf("%d\n",F(sa[i]));
}
return 0;
}
| 61 |
30,353 | int fei(int k)
{
int f[21] = {0};
f[1] = 1;
f[2] = 1;
int i;
for (i = 3; i <= 21; i ++)
{
f[i] = f[i - 1] + f[i - 2];
}
return f[k];
}
int main()
{
int i, n, a;
cin >> n;
for (i = 0; i < n; i ++)
{
cin >> a;
cout << fei(a) << endl;
}
return 0;
}
| 61 |
30,354 | int f(int i)
{
int a[20];
if(i==0)
return 1;
else if(i==1)
return 1;
else
{
a[i]=f(i-1)+f(i-2);
return a[i];
}
}
main()
{
int n,i,b[20];
scanf("%d",&n);
for(int k=0;k<n;k++)
{
scanf("%d",&b[k]);
printf("%d\n",f(b[k]-1));
}
} | 61 |
30,355 | int num[100000] = {0};
int f(int n)
{
if(num[n]>0)
return num[n];
else
return(f(n-1)+f(n-2));
}
int main()
{
int n;
cin >> n;
int a;
int out;
num[1] = 1;
num[2] = 1;
while(n--)
{
cin >> a;
if(a==1 || a==2)
cout << 1 << endl;
else
{
out = f(a);
cout << out << endl;
}
}
return 0;
} | 61 |
30,356 | int main()
{
int n,a[10000],b;
scanf("%d",&n);
int i;
for(i=1;i<=n;i++)
{
scanf("%d",&b);
a[1]=1;a[2]=1;
for(int j=3;j<=b;j++)
a[j]=a[j-1]+a[j-2];
printf("%d\n",a[b]);
}
getchar();
getchar();
getchar();
getchar();
}
| 61 |
30,357 | int main(){
int n;
int a[22];
int i;
int g,j;
scanf("%d",&g);
for(j=0;j<g;j++){
scanf("%d",&n);
for (i=0;i<n;i++){
if((i==0)||(i==1)){
a[i]=1;
}
if(i>1){
a[i]=a[i-1]+a[i-2];
}
}
if(j==0){
printf("%d",a[n-1]);
}
else if(j!=0){
printf("\n%d",a[n-1]);
}
}
return 0;
}
| 61 |
30,358 | int main(){
int a,b,n,i,j,z[100],x[100];
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d",&(z[i]));
}
for(i=0;i<n;i++){
for(j=1;j<=z[i];j++){
if(j==1){
a=1;
x[i]=a;
}
if(j==2){
b=1;
x[i]=b;
}
if(j>2){
x[i]=a+b;
a=b;
b=x[i];
}
}
}
for(i=0;i<n;i++){
printf("%d\n",x[i]);
}
return 0;
} | 61 |
30,359 | int main()
{ int n,x[100],a[100],z[100];
scanf("%d",&n);
x[0]=1;x[1]=1;
for(int i=2;i<20;i++){x[i]=x[i-1]+x[i-2];}
for(int j=0;j<n;j++){
scanf("%d",&a[j]);
z[j]=x[a[j]-1];
}
for(int t=0;t<n;t++){
printf("%d\n",z[t]);
}
return 0;
}
| 61 |
30,360 | int main()
{
double a=1,b=1,l=(1+sqrt(5))/2,m=(1-sqrt(5))/2,c;
int i,n,k,h,an;
cin >> h;
for(k=1;k<=h;k++)
{
cin >> n;
a=1;b=1;
for(i=1;i<=n;i++)
{
a=a*l;
b=b*m;
}
c=(a-b)/(l-m);
cout << c << endl;
}
return 0;
}
| 61 |
30,361 |
int main(){
int n,f[21]={1,1};
cin>>n;
for (int j=2;j<20;j++)
f[j]=f[j-1]+f[j-2];
for(int i = 0;i<n;i++){
int x;
cin>>x;
cout<<f[x-1]<<endl;
}
return 0;
} | 61 |
30,362 | void compute(int shuzu);
int main()
{
int n,i,k,sum=0,a,b;
scanf("%d",&n);
int *shuzu=(int*)malloc(sizeof(int)*n);
for(i=0;i<n;i++)
{
scanf("%d",&shuzu[i]);
}
for(i=0;i<n;i++)
{
if(shuzu[i]<=2)
{
printf("1\n");
}else{
a=1;
b=1;
for(k=3;k<=shuzu[i];k++)
{
sum=a+b;
a=b;
b=sum;
}
printf("%d\n",sum);
}
}
free(shuzu);
return 0;
} | 61 |
30,363 |
int ans[21];
int work(int a)
{
if (a <= 2)
return 1;
return (work(a - 1) + work(a - 2));
}
int main()
{
int n, a;
int i;
cin >> n;
for (i = 1; i <= n; i++)
{
cin >> a;
cout << work(a) << endl;
}
return 0;
} | 61 |
30,364 |
int Fibonacci(int x);
int main()
{
int n,a[100];
int i,num[100];
scanf("%d",&n);
for (i=0;i<n;i++)
{
scanf("%d",&a[i]);
num[i]=Fibonacci(a[i]);
}
for (i=0;i<n;i++)
{
printf("%d\n",num[i]);
}
return 0;
}
int Fibonacci(int x)
{
int result=0;
if (x==1 ||x==2)
{
result=1;
return result;
}
else
{
result=Fibonacci(x-1)+Fibonacci(x-2);
return result;
}
} | 61 |
30,365 | int feibo(int a);
int main()
{
int k,sz[100],i,szresult[100];
sz[100]=0;
scanf("%d",&k);
for(i=0;i<=k-1;i++)
{
scanf("%d",&sz[i]);
}
for(i=0;i<=k-1;i++)
{
szresult[i]=feibo(sz[i]);
}
for(i=0;i<=k-1;i++)
{
printf("%d\n",szresult[i]);
}
return 0;
}
int feibo(int a)
{
int result,i,result1,result2;
if(a<=2)
{
result=1;
return result;
}
else{
result1=1;
result2=1;
for(i=1;i<=a-2;i++)
{
result=result1+result2;
result1=result2;
result2=result;
}
return result;
}
} | 61 |
30,366 | //1200012979
int look(int);
int main()
{
int n, a, count=0;
cin >> n;
while(count < n)
{
count++;
cin >> a;
cout << look(a)<< endl;
}
return 0;
}
int look(int a)
{
if(a < 3)
return 1;
else
return look(a-1)+look(a-2);
} | 61 |
30,367 | int main()
{
int fei[20],n,i;
int input[20],output[20];
fei[0]=1;
fei[1]=1;
for(i=2;i<20;i++)
{
fei[i]=fei[i-1]+fei[i-2];
}
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&input[i]);
output[i]=fei[input[i]-1];
}
for(i=0;i<n;i++)
{
printf("%d\n",output[i]);
}
return 0;
} | 61 |
30,368 | /*
*???: 1.cpp
*??????
*????: 2012-10-19
*??: ???????????n?n???????????????a??????
*/
int main ()
{
int n = 0, iNum = 0;
int a[20] = {1,1};
for (int i = 2; i < 20; i++)
{
a[i] = a[i-1] + a[i-2];
} //??????????
cin >> n;
int b[n];
for (int j = 1; j <= n; j++)
{
cin >> iNum;
b[j-1]= a[iNum-1];
} //??????
for (int k = 1;k <= n;k++)
{
cout << b[k-1] << endl;
} //??????
return 0;
} | 61 |
30,369 | /*
* ????22.cpp
* ??????
* ????: 2012-9-30
* ??:??????????
*/
int main(){
int n=0,i=0,j=0,m=0; //i,j?????
cin>>n;
for (i=0;i<n;i++){ //???????
cin>>m;
int a[m];
a[0]=1;
a[1]=1;
for (j=2;j<=m;j++){
a[j]=a[j-1]+a[j-2]; //????????m?
}
cout<<a[m-1]<<endl;
}
return 0;
} | 61 |
30,370 | int main()
{
int n,a,i,a1,a2,t,l,m;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d",&a);
a1=1;a2=1;
if(a==1)
l=a1;
else {
if(a==2)
l=a2;
else {
l=2;
for(t=1;t<a-2;t++){
m=a2;
a2=l;
l+=m;
}
}
}
printf("%d\n",l);
}
return 0;
}
| 61 |
30,371 | int main()
{
int x[21], i, n, y[100];
x[1] = 1;
x[2] = 1;
for(i = 3; i < 21; i++)
{
x[i] = x[i - 1] + x[i - 2];
}
cin >> n;
for(i = 0; i < n; i++)
{
cin >> y[i];
}
for(i = 0; i < n; i++)
{
cout << x[y[i]] << endl;
}
return 0;
} | 61 |
30,372 |
int main()
{
int n;
int a;
int i,f[21];
cin >> n;
while(n--)
{
cin >> a;
f[1] = 1;
f[2] = 1;
if(a >=3)
{
for(i = 3; i <=a; i++)
f[i] = f[i-1] + f[i-2];
}
cout << f[a] << endl;
}
}
| 61 |
30,373 |
int main()
{
int *arr;
int n,i,k;
int a;
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%d",&a);
arr=(int*)malloc(sizeof(int)*a);
for(k=0;k<a;k++)
{
if(k==0||k==1)
arr[k]=1;
else
arr[k]=arr[k-1]+arr[k-2];
}
printf("\n%d\n",arr[a-1]);
}
return 0;
} | 61 |
30,374 | /*
* 38.cpp
*??????
* Created on: 2012-11-2
* Author: ???
*/
int main() { //?????
int i, j, n, m; //??int???
int f[25]; //????f
f[1] = 1;
f[2] = 1; //???f[1],f[2]??
cin >> m; //??????
for (j = 1; j <= m; j++) {
cin >> n; //?????n
if ((n == 1) || (n == 2)) {
cout << f[n] << endl;
} //??n??1?2???1
else {
for (i = 3; i <= n; i++) {
f[i] = f[i - 1] + f[i - 2];
} //??n??2????????
cout << f[n] << endl; //????
}
}
return 0; //?????
}
| 61 |
30,375 |
int main()
{
int n;
cin >> n;
while (n --)
{
int num;
cin >> num;
if (num == 1 || num == 2)
cout << "1" << endl;
else
{
int f1, f2, result;
f1 = 1;
f2 = 1;
while (num > 2)
{
result = f1 + f2;
f1 = f2;
f2 = result;
num --;
}
cout << result << endl;
}
}
return 0;
}
| 61 |
30,376 | int F_num[10000];
int main()
{
int test_total,max = 0,test_site;
int i,j,k;
F_num[0]=1;
F_num[1]=1;
max = 1;
scanf ("%d",&test_total);
for (i=0; i<test_total; i++)
{
scanf ("%d", &test_site);
if (max >= test_site)
{
printf("%d\n", F_num[test_site-1]);
}
else
{
for(j=max +1; j<=test_site; j++)
{
F_num[j] = F_num[j-1]+F_num[j-2];
}
max = test_site;
printf("%d\n", F_num[test_site-1]);
}
}
return 0;
}
| 61 |
30,377 |
int compare(const void *a, const void *b)
{
return *(int*)a - *(int *)b;
}
int main()
{
int n, a[100], b;
a[0] = 1, a[1] =1;
cin >> n;
for (int i = 2; i <= 30; i ++)
{
a[i] = a[i-1] + a[i-2];
}
for (int i = 0; i < n; i ++)
{
cin >> b;
cout << a[b-1] << endl;
}
return 0;
} | 61 |
30,378 | int main(int argc, char* argv[])
{
int a,b,c,n;
int sz[20];
int wt[20];
sz[1]=1;
sz[2]=1;
scanf("%d",&n);
for(a=0;a<n;a++)
{
scanf("%d",&wt[a]);
}
for(a=0;a<=n;a++)
{
b=wt[a];
if(b==1)
{
printf("%d\n",sz[1]);
}
else if(b==2)
{
printf("%d\n",sz[2]);
}
else if(b>=3)
{
for(c=3;c<=b;c++)
{
sz[c]=sz[c-2]+sz[c-1];
}
printf("%d\n",sz[b]);
}
}
return 0;
}
| 61 |
30,379 | /*
* ??????????.cpp
* ??????
* ?????2012.10.23
* ?????????
*/
int main()
{
int n,a,b,i,s,p;
cin>>s;
for (p=1;p<=s;p++)
{
cin>>n;
a=b=1;
i=2;
if (n<=2)
cout<<a<<endl;
else
{
while (i<=n)
{
a=a+b;
i++;
if (i==n)
{cout<<a<<endl;break;}
else
{
b=a+b;
i++;
if (i==n)
{cout<<b<<endl;break;}
}
}
}
}
return 0;
}
| 61 |
30,380 |
int main()
{
int i,a,n,t;
int f[25]={1,1};
int b[20];
scanf("%d",&n);
for(i=2;i<25;i++)
f[i]=f[i-2]+f[i-1];
for(i=0;i<n;i++){
scanf("%d",&a);
b[i]=a-1;}
for(i=0;i<n;i++)
{
t=b[i];
printf("%d\n",f[t]);}
}
| 61 |
30,381 | int F(int n);
int main(){
int a,n[20],r=0,m[20],i;
scanf("%d",&a);
for(i=0;i<a;i++){
scanf("%d",&n[i]);
}
for(i=0;i<a;i++){
m[i]=F(n[i]);
printf("%d\n",m[i]);
}
return 0;
}
int F(int n){
int a=1,b=1,j,r;
if(n==1){
r=1;
}
if(n==2){
r=1;
}
for(j=2;j<n;j++){
r=a+b;
a=b;
b=r;
}
return r;
}
| 61 |
30,382 |
int main()
{
int n,i,j;
int ph[20] = {1, 1};
int a[20];
for (i=2; i<20; i++)
ph[i] = ph[i-2] + ph[i-1];
scanf("%d\n", &n);
for (j = 0; j < n; j++)
scanf("%d", &a[j]);
for (j = 0; j < n; j++)
printf("%d\n", ph[a[j]-1]);
return 0;
} | 61 |
30,383 | int main()
{
int f[20]={1,1};//f????????fibonacci
int g[20];//g???????????
int i=2;
for(i=2;i<=20;i++)
{
f[i]=f[i-2]+f[i-1];
} //????????
int n,a;
cin>>n; // n???????,a???????????
for(int j=1;j<=n;j++)
{
cin>>a;
g[j]=f[a-1];//f??0???????????????a???????
}
for(int k=1;k<=n;k++)
{
cout<<g[k]<<endl;//?????
}
return 0;
}
| 61 |
30,384 | int main()
{
int one = 1, two = 1;
int count;
int num;
int i;
int sum;
scanf("%d", &count);
while (count --) {
scanf("%d", &num);
if (num == 1 || num == 2) {
printf("1\n");
continue;
}
num -= 2;
one = 1, two = 1;
sum = 0;
for (i = 0; i < num; i ++) {
sum = one + two;
one = two;
two = sum;
}
printf("%d\n", sum);
}
return 0;
} | 61 |
30,385 | int main()
{
int n,m[20],a,j,i,b,c;
scanf("%d",&n);
for(i=1;i<n+1;i++)
{
a=1;
b=1;
scanf("%d",&(m[i]));
if(m[i]>2)
{
for(j=3;j<m[i]+1;j++)
{
c=b;
b=a;
a=b+c;
}
printf("%d\n",a);
}
else
{
a=1;
printf("%d\n",a);
}
}
return 0;
}
| 61 |
30,386 | //********************************
//*???2.cpp **
//*?????? 1200012768 **
//*???2013.1.10 **
//*????????? **
//********************************
int fun(int a)
{
if (a <= 2)
return 1;
return fun(a - 1) + fun(a - 2);
}
int main()
{
int n, a;
cin >> n;
while (n--)
{
cin >> a;
cout << fun(a) << endl;
}
return 0;
}
| 61 |
30,387 | int f(int n);
int main(){
int a[10000],s[10000],x,k;
scanf("%d",&k);
for(x=0;x<k;x++){
scanf("%d",&a[x]);
s[x]=f(a[x]);
printf("%d\n",s[x]);
}
return 0;
}
int f(int n){
int a[100000],i;
a[1]=1;
a[2]=1;
if(n>2){
for(i=3;i<=n;i++){
a[i]=a[i-1]+a[i-2];
}
}
return a[n];
}
| 61 |
30,388 | int sum(int m);
int main()
{
int m,n,i,a[100];
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%d",&m);
printf("%d\n",sum(m));
}
}
int sum(int m)
{
int i,a[100];
for(i=3;i<=21;i++)
{
a[1]=1;a[2]=1;
a[i]=a[i-1]+a[i-2];
}
return a[m];
}
| 61 |
30,389 | main()
{
int n;
scanf("%d",&n);
int fb[29];
fb[1]=1;
fb[2]=1;
int i;
for(i=3;i<22;i++)
{
fb[i]=fb[i-1]+fb[i-2];
}
//for(i=1;i<21;i++)
// printf("%d ",fb[i]);
for(;n>0;n--)
{
int a;
scanf("%d", &a);
printf("%d\n",fb[a]);
}
}
| 61 |
30,390 | int main(){
int n,i,c;
int a[1000];
int b[1000];
int g[1000];
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d",&a[i]);
}
b[0]=1;
b[1]=1;
for(i=2;i<1000;i++){
b[i]=b[i-1]+b[i-2];
}
for(i=0;i<n;i++){
c=a[i]-1;
g[i]=b[c];
}
for(i=0;i<n;i++){
printf("%d\n",g[i]);
}
return 0;
} | 61 |
30,391 | int main(){
int k,n,s=0;
int a=1,b=1;
scanf("%d",&k);
for(int q=1;q<=k;q++){
scanf("%d",&n);
if(n==1||n==2){
s=1;
}
else{
for(int w=1;w<n-1;w++){
s=a+b;
a=b;
b=s;
}
}
printf("%d\n",s);
s=0;
a=1;
b=1;
}
return 0;
}
| 61 |
30,392 | main()
{
int n,t,i,Y;
scanf("%d",&n);
int s[n];
for(i=0;i<=(n-1);i++)
{
scanf("%d",&t);
s[i]=t;
}
for(i=0;i<=(n-1);i++)
{
int a=1,b=1,c=1;
for(Y=3;Y<=s[i];Y++)
{
c=a+b;
a=b;
b=c;
}
printf("%d\n",c);
}
getchar();
getchar();
getchar();
getchar();
} | 61 |
30,393 |
int main()
{
int n,F[25];
int i;
for(i=1;i<=20;i++)
{
if(i==1 || i==2)
F[i] = 1;
else
F[i] = F[i-1]+F[i-2];
}
cin>>n;
while(n>0)
{
n--;
int a;
cin>>a;
cout<<F[a]<<endl;
}
return 0;
} | 61 |
30,394 | int main()
{
int i,n,a,j,s;
int b[100];
scanf("%d",&n);
int c[200];
for(i=0;i<n;i++)
{scanf("%d",&c[i]);}
for(i=0;i<n;i++)
{
for(j=0;j<c[i];j++)
{b[0]=1;
b[1]=1;
if(c[i]==1)
{s=b[0];}
if(c[i]==2)
{s=b[1];}
if(c[i]>=3)
{
b[j+2]=b[j]+b[j+1];
s=b[c[i]-1];
}
}
printf("%d\n",s);
}
}
| 61 |
30,395 | int main(){
int n,i,j;
int an[20];
int fb(int a);
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d",&an[i]);
}
for (j=1;j<=n;j++){
if (an[j-1]==1||an[j-1]==2){
printf("1\n");
}
else {
printf("%d\n",fb(an[j-1]));
}
}
return 0;
}
int fb(int a){
int n1=1,n2=1,m,t;
for (t=3;t<=a;t++){
m=n1+n2;
n1=n2;
n2=m;
}
return m;
} | 61 |
30,396 | int main()
{
int feb(int x);
int n,a;
cin >> n;
int b[n];
for (int i=0;i<n;i++)
{
cin >> a;
b[i]=feb(a);
}
for (int i=0;i<n;i++)
{
cout << b[i] << endl;
}
return 0;
}
int feb(int x)
{
int p=1,q=1,w;
if (x>=3)
for (int i=3;i<=x;i++)
{
w=p+q;
p=q;
q=w;
}
else
w=1;
return w;
}
| 61 |
30,397 | int feibonaqishulie(int a)
{
int b,a1,a2,i;
a1=a2=1;
if(a==1|a==2) b=1;
else
for(i=2;i<a;i++)
{
b=a1+a2;
a1=a2;
a2=b;
}
return(b);
}
int main()
{
int n,a;
cin>>n;
for(int i=0;i<n;i++)
{
cin>>a;
cout<<feibonaqishulie(a)<<endl;
}
return 0;
} | 61 |
30,398 |
int main()
{
int a[20]={1,1};
int i=0;
for (i=2;i<=20;i++) a[i]=a[i-1]+a[i-2];//?20?
int n=0;
cin>>n;
int b[100]={0};//????
for (i=0;i<=n-1;i++)
{
cin>>b[i];
}
for (i=0;i<=n-1;i++)
{
cout<<a[b[i]-1]<<endl;
}
return 0;
} | 61 |
30,399 |
int main() {
int a,n,i=1,j=2,o=1,p=1,q=1; //???a???q
cin>>n;
while (i<=n){
cin>>a;
while(j<a){
q=o+p;
o=p;
p=q;
j=j+1; //????q
}
cout<<q<<endl; //??q
i=i+1;
j=2;
o=1;
p=1;
q=1; //??
}
return 0;
}
| 61 |
Subsets and Splits