id
int32 0
32.5k
| code
stringlengths 95
8.4k
| label
stringclasses 65
values |
|---|---|---|
30,400 | int f(int n){
int k;
if(n==1||n==2) k=1;
else{
k=f(n-2)+f(n-1);
}
return k;
}
int main(){
int t,n,i,j;
scanf("%d",&t);
for(j=0;j<t;j++){
scanf("%d",&n);
i=f(n);
printf("%d\n",i);
}
scanf("%d",&i);
return 0;
}
| 61 |
30,401 | /*
* ??????.cpp
*
* Created on: 2012-10-19
* Author: ??
* ?????????a?????
*/
int main(){
int a[21]; //????a[21]
int i=0,j=0,n=0; //????
cin>>n; //??????????n
a[1]=1;
a[2]=1; //?a[1],a[2]????
for(i=3; i<=20 ;i++)
a[i]=a[i-1]+a[i-2]; //?a[i]????
for(j=1; j<=n ;j++)
{ cin>>i;
cout<<a[i]<<endl;
} //??n???
return 0;
}
| 61 |
30,402 | int main()
{
int f(int n);
int n,a[10],i;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&a[i]);
for(i=0;i<n;i++)
printf("%d\n",f(a[i]));
return 0;
}
int f(int n)
{
int b;
if(n==1||n==2)
b=1;
else
b=f(n-1)+f(n-2);
return(b);
}
| 61 |
30,403 |
void main()
{
int n,i,a;
int num[20]={1,1};
for(i=2;i<20;i++)
{
num[i]=num[i-1]+num[i-2];
}
scanf("%d\n",&n);
for(i=1;i<=n;i++)
{
scanf("%d",&a);
printf("%d\n",num[a-1]);
}
} | 61 |
30,404 | //********************************
//*?? ?????? *****
//*????? 1300012753 *****
//*???2013.11.20 *****
//********************************
int cal(int i)
{
if(i == 1 || i == 2)
return 1;
else
return cal(i - 1) + cal(i - 2);
}
int main()
{
int n;
cin >> n;
int a[100];
for(int i = 1; i <= n; i++)
{
int t;
cin >> t;
a[i] = cal(t);
}
for(int i = 1; i <= n; i++)
cout << a[i] << endl;
return 0;
} | 61 |
30,405 | int f(int a);
int main()
{
int n,a,i;
scanf("%d",&n);
for(i=1;i<=n;i++){
scanf("%d",&a);
printf("%d\n",(f(a)));
}
return 0;
}
int f(int a){
int i;
int d=1;
int e=1;
int g=2;
if(a==1||a==2){
return 1;
}else if(a==3){
return 2;
}else {
for(i=4;i<=a;i++){
d=e;
e=g;
g=d+e;
}
return g;
}
} | 61 |
30,406 | main() { int f[20],a[20],i,j,n;
scanf("%d",&n);
f[1]=1; f[2]=1;
for(i=2;i<=20;i++)
f[i+1]=f[i]+f[i-1];
for(i=1;i<=n;i++)
{ scanf("%d",&a[i]);
printf("\n"); }
for(j=1;j<=n;j++)
{ printf("%d",f[a[j]]);
printf("\n"); }
}
| 61 |
30,407 | int x;
int f(int n)
{
if (n == 1 || n == 2)
{
x = 1;
}
else
{
x = f(n - 1) + f(n - 2);
}
return x;
}
int main()
{
int n, i, a;
cin >> n;
for (i = 1; i <= n; i++)
{
cin >> a;
cout << f(a) << endl;
}
return 0;
}
| 61 |
30,408 | int fei(int m)
{
if (m == 1)
return 1;
if (m == 2)
return 1;
return fei(m - 1) + fei(m - 2);
}
int main()
{
int n, i, a[20], num;
cin >> n;
for (i = 0; i < n; i++)
{
cin >> a[i];
num = fei(a[i]);
cout << num << endl;
}
return 0;
}
| 61 |
30,409 | int main(){
int n;
scanf("%d",&n);
int a[20];
int i,m;
for(i=0;i<n;i++){
scanf("%d",&a[i]);
}
int sz[20];
for(i=0;i<20;i++){
if(i==0){
sz[i]=1;
}else if(i==1){
sz[i]=1;
}else{
sz[i]=sz[i-1]+sz[i-2];
}
}
for(i=0;i<n;i++){
if(i==n-1){
m=a[i];
printf("%d",sz[m-1]);
m=0;
}else{
m=a[i];
printf("%d\n",sz[m-1]);
m=0;
}
}
return 0;
}
| 61 |
30,410 | void main()
{
int n,a[100],f1,f2,i,t,j;
scanf("%d",&n);
for (i=0;i<n;i++)
scanf("%d",&a[i]);
for (i=0;i<n;i++)
{ f1=1;
f2=1;
for (j=2;j<a[i];j++)
{
t=f1;
f1=f2;
f2=f2+t;
}
printf("%d\n",f2);}
} | 61 |
30,411 | void main()
{
int n,a[21],b[21],j,i;
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%d",&a[i]);
b[1]=1;
b[2]=1;
for(j=3;j<=a[i];j++)
{
b[j]=b[j-1]+b[j-2];
}
printf("%d\n",b[a[i]]);
}
}
| 61 |
30,412 | int main(){
int n,x,j,l,k;
int i=1;
int a[10000];
scanf("%d",&n);
while(i<=n)
{
scanf("%d",&x);
a[0]=1;
a[1]=1;
if(x==1||x==2)
printf("1");
else
{
j=2;
while(j<x)
{
a[j]=a[j-1]+a[j-2];
j++;
}
printf("%d\n",a[j-1]);
}
i++;
}
return 0;
} | 61 |
30,413 | int f(int a);
int main()
{
int a,n,k,i;
int r[100];
scanf("%d",&k);
for(i=1;i<=k;i++){
scanf("%d",&n);
a=f(n);
printf("%d\n",a);}
return 0;
}
int f(int a){
if(a==3){return 2;}
else if(a==2||a==1){return 1;}
else return (f(a-1)+f(a-2));
} | 61 |
30,414 | //============================================================================
// Name : shulie.cpp
// Author : shaodian
// Version :
// Copyright : Your copyright notice
// Description :
//============================================================================
int main() {
int s[100]={0};//???????100???
int n=0;
cin>>n;
for(int i=0;i<n;i++)//?i??1?i??
{ cin>>s[i];
if (s[i]==1||s[i]==2)cout<<1<<endl;//???????????????1
else
{long long int f[10000];//????????
f[1]=1;f[2]=1;
for(int j=3;j<=s[i];j++)//?j??3?????s[i]???
{
f[j]=f[j-1]+f[j-2];//???????????
}
cout<<f[s[i]]<<endl;}
}
return 0;
} | 61 |
30,415 | int main()
{
int test[1000000];
int num, i, j;
cin>>num;
int f[30]= {1,1,1};
int cur;
for(i = 3; i < 21; i ++)
{
f[i] = f[i-1] + f[i-2];
}
for(i = 0 ; i < num ; i++)
{
cin>>cur;
cout<<f[cur]<<endl;;
;
}
return 0;
} | 61 |
30,416 | int main()
{
int i,j,n,a[20],number=0,e=0,f=1,g=0;
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++)
{
number=e+f;
g=e;
e=number;
f=g;
}
printf("%d\n",number);
number=0;
e=0;
f=1;
}
return 0;
} | 61 |
30,417 | /*
* feibunaqishulie.cpp
*
* Created on: 2012-10-21
* Author: 1200012791??
* ????????????????: ?????????????1????????????2????? ???????a???????????a??????
*/
int main(){
int n=0,i=0,j=0,p=0,q=0,r=0; //??6???????????0
cin>>n; //??n
int a[n],b[n]; //??????
for(;i<n;i++) cin>>a[i]; //????a[n]????
for(;j<n;j++){ //????
p=0; //?????
q=1; //?????
for(b[j]=0;b[j]<a[j]-1;b[j]++){ //1?a[j]-1????
r=p; //????????r
p=q; //???????????
q+=r; //?????
}
cout<<q<<endl; //?????n??
}
return 0;
} | 61 |
30,418 | int fibo(int x);
int main()
{
int shuzu[N];
int n,a,i;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&(shuzu[i]));
}
for(i=0;i<n;i++)
{
a=fibo(shuzu[i]);
printf("%d\n",a);
}
return 0;
}
int fibo(int x)
{
int p=1,q=1,temp,result,k;
if((x==1)||(x==2))
{
result=1;
}
else
{
for(k=x;k>2;k--)
{
temp=q;
q=q+p;
p=temp;
}
result=q;
}
return result;
} | 61 |
30,419 | int num(int n)
{
if(n==1) return 1;
if(n==2) return 1;
if(n>=3) return num(n-1)+num(n-2);
}
int main()
{
int n,s,i;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&s);
printf("%d\n",num(s));
}
getchar();
getchar();
} | 61 |
30,420 | main()
{
int n,i,a[10000],b[10000];
int cal(int x);
scanf("%d",&n);
for(i=1;i<=n;i++) {scanf("%d",&a[i]);}
for(i=1;i<=n;i++) {b[i]=cal(a[i]);}
printf("%d",b[1]);
for(i=2;i<=n;i++) {printf("\n%d",b[i]);}
}
int cal(int x)
{
int i,a[30],t;
a[1]=1;a[2]=1;
for(i=3;i<=30;i++) {a[i]=a[i-1]+a[i-2];}
t=a[x];
return(t);
} | 61 |
30,421 | int main(){
int n,i,j,max,tran;
scanf("%d",&n);
int a[n];
for(i=0;i<n;i++){
scanf("%d",&a[i]);
}
max=a[0];
for(i=0;i<n;i++){
if(a[i]>max){
max=a[i];
}
}
int F[max+3];
F[0]=1;
F[1]=1;
for(i=0;i<max;i++){
F[i+2]=F[i]+F[i+1];
}
for(i=0;i<n;i++){
printf("%d\n",F[a[i]-1]);
}
return 0;
}
| 61 |
30,422 | int main () {
int a[999],b[999],c[999],i,k,n,d[999];
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d",&d[i]);
a[i]=1;
b[i]=1;
}
for(i=0;i<n;i++){
if(d[i]>=3){
for(k=3;k<=d[i];k++){
c[i]=a[i]+b[i];
a[i]=b[i];
b[i]=c[i];}
printf("%d\n",c[i]);}
else{printf("1");}
}
return 0;
} | 61 |
30,423 | /*
*??????????.cpp
*??????
*?????2012-10-15
*??????????a???????????a??????
*/
int main ()
{
int n,a,i,j,a1 = 1,a2 = 1,a3;//??????n;???a;????i,j;?a-2????a-1???a1,a2?????1??a??a3
cin >> n;//???????n
for (i = 1; i <= n; i++)//???????
{
cin >> a;//???????a
if ( a == 1 || a == 2)//???1?2??????1
cout << "1" << endl;
else//?a>=3???????i?a3
{
for (j = 3; j <= a; j++)//????a3
{
a3 = a1 + a2;//a3???????
a1 = a2;//?????j+1???a2???j-2?
a2 = a3;//a3??j-1??
}
cout << a3 << endl;//????
a1 = 1;//??a1,a2???????????
a2 = 1;
}
}
return 0;
}
| 61 |
30,424 | int f(int n)
{
int k;
if(n==1||n==2)
k=1;
else
k=f(n-1)+f(n-2);
return k;
}
main()
{
int n,i,k;
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%d",&k);
printf("%d\n",f(k));
}
getchar();
getchar();
return 0;
}
| 61 |
30,425 | int f(int n)
{
int c;
if(n==1||n==2)
c=1;
else
c=f(n-1)+f(n-2);
return(c);
}
main()
{
int n,i,m;
int f(int n);
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&m);
printf("%d\n",f(m));
}
getchar();
getchar();
} | 61 |
30,426 | main()
{
int n,a[20],b[20],i,j;
scanf("%d",&n);
printf("\n");
for(i=1;i<=n;i++)
{
scanf("%d",&a[i]);
printf("\n");
}
b[1]=1,b[2]=1;
for(j=3;j<=20;j++)
b[j]=b[j-1]+b[j-2];
for(i=1;i<=n;i++)
{
printf("%d\n",b[a[i]]);
printf("\n");
}
getchar();
getchar();
}
| 61 |
30,427 | void main()
{
int n, i, b[50];
int f(int);
scanf("%d",&n);
for(i=1; i<=n; i++)
{
scanf("%d",&b[i]);
}
for(i=1; i<=n; i++)
{
printf("%d\n",f(b[i]));
}
}
int f(int x)
{
if(x!=1 && x!=2)
{
return(f(x-1)+f(x-2));
}
if(x==1 || x==2) return 1;
return 0;
} | 61 |
30,428 | int main()
{
int F(int); //??????k????
int n; //n????????
cin>>n;
for(int i=1;i<=n;i++)
{
int k;
cin>>k;
cout<<F(k)<<endl;
}
return 0;
}
int F(int k)
{
if(k==1||k==2)
return 1;
int a=1,b=1,c;
for(int i=3;i<=k;i++)
{
c=a+b; //??????????c?
a=b;b=c;
}
return b;
}
| 61 |
30,429 | int main()
{
int n,i,j,k;
int a[1000];
int b[21];
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&a[i]);
b[1]=1;
b[2]=1;
for(j=3;j<=20;j++)
{ b[j]=b[j-1]+b[j-2];}
for(i=0;i<n;i++)
printf("%d\n",b[a[i]]);
return 0;
}
| 61 |
30,430 |
int fac(int);
int main()
{
int n, y, times;
cin >> times;
for (int i = 0; i < times; i++)
{
cin >> n;
y = fac(n);
cout << y << endl;
}
return 0;
}
int fac(int n)
{
if (n == 1 || n == 2)
return 1;
else
return fac(n - 1) + fac(n - 2);
} | 61 |
30,431 | int main()
{
int n=0,a=0,x=1,y=1,m=0,i=0;
cin>>n;
for(int j=0;j<n;j++){
cin>>a;
x=1;y=1;
if((a==1)||(a==2))cout<<1<<endl;
if(a>2){
for(i=1;i<=(a-2);i++){
m=x+y;
x=y;
y=m;
}
cout<<m<<endl;
}
}
return 0;
} | 61 |
30,432 | int main()
{
int n,a;
scanf("%d",&n);
for (int i=0;i<n;i++)
{
scanf("%d",&a);
int b[a];
if (a==1||a==2) printf("1\n");
else
{
b[0]=1;
b[1]=1;
for (int j=2;j<a;j++)
b[j]=b[j-1]+b[j-2];
printf("%d\n",b[a-1]);
}
}
} | 61 |
30,433 | int febonaqi(int a){
if(a==1) return 1;
else if(a==2) return 1;
else return febonaqi(a-1)+febonaqi(a-2);
}
int main(){
int n;
cin>>n;
while(n>0){
int s;
cin>>s;
cout<<febonaqi(s)<<endl;
n--;
}
return 0;
} | 61 |
30,434 | int f(int a)
{
if(a==1||a==2)
return 1;
else
return f(a-1)+f(a-2);
}
main()
{
int n;
scanf("%d",&n);
int i;
int a;
for(i=0;i<n;i++)
{
scanf("%d",&a);
printf("%d\n",f(a));
}
getchar();
getchar();
}
| 61 |
30,435 | int F(int n);
int main()
{
int n,i;
int a[10];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
for(i=0;i<n;i++)
{
printf("%d\n",F(a[i]));
}
return 0;
}
int F(int n)
{
if (n<=2)
return 1;
return F(n-1)+F(n-2);
}
| 61 |
30,436 | int main(){
int n,i,t;
int a[50]={1,1};
int b[100],c[100];
for(i=0;i<48;i++)
a[i+2]=a[i]+a[i+1];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&b[i]);
t=b[i];
c[i]=a[t-1];
}
for(i=0;i<n;i++)
printf("%d\n",c[i]);
}
| 61 |
30,437 | int ferbo(int r)
{
if(r==1||r==2)
return 1;
else
return ferbo(r-1)+ferbo(r-2);
}
int main()
{
int b[20],i,n;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&b[i]);
}
for(i=0;i<n;i++)
{
printf("%d\n",ferbo(b[i]));
}
}
| 61 |
30,438 | //********************************
//*?? ?????? *****
//*????? 1300012753 *****
//*???2013.11.20 *****
//********************************
int cal(int i)
{
int ans;
if(i == 1 || i == 2)
ans = 1;
else
{
ans = cal(i - 1) + cal(i - 2);
}
return ans;
}
int main()
{
int n;
cin >> n;
int a[100];
for(int i = 1; i <= n; i++)
{
int t;
cin >> t;
a[i] = cal(t);
}
for(int i = 1; i <= n; i++)
cout << a[i] << endl;
return 0;
} | 61 |
30,439 | int main()
{
int a[21],m,p;
a[0]=0;
a[1]=1;
for(int i=2;i<21;i++){
a[i]=a[i-1]+a[i-2];
}
int n;
scanf("%d",&n);
for(int j=0;j<n;j++){
scanf("%d",&p);
printf("%d\n",a[p]);
}
int hou;
scanf("%d",&hou);
return 0;
}
| 61 |
30,440 | int main()
{
int a[21] = {0}, n, i, m;
cin >> n;
a[1] = 1;
a[2] = 1;
while(n--)
{
cin >> m;
if(m == 1 || m == 2)
cout << 1 << endl;
else
{
for(i = 3; i <= m; i++)
a[i] = a[i - 1] + a[i - 2];
cout << a[m] << endl;
}
}
return 0;
} | 61 |
30,441 | int main()
{
int a,n;
int i,j;
scanf("%d",&n);
int b[20];
b[0]=1;b[1]=1;
for(i=0;i<n;i++)
{
scanf("%d",&a);
if(a==1) printf("%d\n",b[0]);
else if(a==2) printf("%d\n",b[1]);
else if(a>2)
{
for(j=2;j<a;j++)
b[j]=b[j-1]+b[j-2];
printf("%d\n",b[a-1]);
}
}
getchar();
getchar();
}
| 61 |
30,442 | void main(){
int sz1[20],sz2[20];
int i,n,j,b,s=0;
scanf("%d",&n);
sz1[0]=sz1[1]=1;
for(i=2;i<20;i++){
sz1[i]=sz1[i-1]+sz1[i-2];
}
for(i=0;i<n;i++){
scanf("%d",&b);
sz2[i]=sz1[b-1];
}
for(i=0;i<n;i++){
printf("%d\n",(sz2[i]));
}
}
| 61 |
30,443 | int main(){
int i,m,c[20],d[20],a,b,e,f;
scanf("%d",&m);
for(i=0;i<m;i++){
scanf("%d",&c[i]);
}
for(i=0;i<m;i++){
a=1;b=1;
if(c[i]==1||c[i]==2){
d[i]=1;
}
else if(c[i]==3){
d[i]=2;
}
else{
for(int k=3;k<c[i];k++){
f=b;
b=a+b;
a=f;
d[i]=a+b;
}
}
}
for(i=0;i<m;i++){
printf("%d\n",d[i]);
}
return 0;
}
| 61 |
30,444 | int a[100] = {0};
int f(int num)
{
if (a[num] == 0)
return (f(num - 1) + f (num - 2));
else
return a[num];
}
int main()
{
a[1] = 1;
a[2] = 1;
int num, n;
cin >> n;
for (int i = 1; i <= n; i++)
{
cin >> num;
cout << f(num) << endl;
}
return 0;
} | 61 |
30,445 | //****************************************
//*????????? **
//*?????? 1100012763 **
//*???2011.9.29 **
//****************************************
int main()
{
int n , i , a;
int feibo[20];
feibo[0] = 1; //????????
feibo[1] = 1;
for (i = 2; i <= 19; i++)
feibo[i] = feibo[i - 1] + feibo[i - 2];
cin >> n;
for (i = 1; i <= n; i++)
{
cin >> a;
cout << feibo[a-1];
if (i != n)
cout << endl;
}
return 0;
}
| 61 |
30,446 | /*
* 1.cpp
*
* Created on: 2012-10-8
* Author: Lixurong
*/
int add( int a );
int main()
{
int n; //????
cin >> n ; //????
for( int i=0; i<n; i++ )
{
int a; //????
cin >> a; //????
if( a == 1 || a == 2 )
{
cout << 1 << endl; //??
continue;
}
cout << add(a) << endl; //????
}
return 0; //??
}
int add( int a ) //??????????
{
if( a == 1 )
return 1;
else if( a == 2 )
return 1;
else
return (add(a-1) + add(a-2));
} | 61 |
30,447 | int f( int a)
{
if (a<=2)
return 1;
else
return f(a-1)+f(a-2);
}
main()
{
int a,b,c,d,i;
scanf("%d",&a);
for (i=0;i<a;i++)
{
scanf("%d",&b);
printf("%d\n",f(b));
}
getchar ();
getchar ();
}
| 61 |
30,448 | int suan(int n,int *p)
{
p=(int*)malloc(sizeof(int)*n);
if(n==1||n==2)
{
*(p+n-1)=1;
}
else
{
*(p+n-1)=suan(n-1,p)+suan(n-2,p);
}
return *(p+n-1);
}
int main()
{
int b,n,i;
scanf("%d",&b);
for(i=0;i<b;i++)
{
scanf("%d",&n);
int a[n];
int *p;
p=a;
printf("%d\n",suan(n,p));
}
getchar();
getchar();
getchar();
}
| 61 |
30,449 | /*
* Homework3.5FibonacciSequence.cpp
*
* ?????????????: ?????????????1????????????2?????
* ???????a???????????a??????
* Created on: 2013-10-27
* Author: JuiceHe
*/
int main()
{
int str[50]={1,1},num[20];int n,i;
for(i=2;i<50;i++)
str[i]=str[i-1]+str[i-2];//????????
cin>>n;//????n
for(i=0;i<=n-1;i++)
cin>>num[i];//??n????????n???
for(i=0;i<=n-1;i++)
cout<<str[num[i]-1]<<endl;//?????????????
return 0;
}
| 61 |
30,450 | int main ()
{
int n=0,i=0,x=1,m=1,t=1,s=0;
cin>>n;
int a[10];
for(i=0;i<n;i+=1)
{
cin>>a[i];}
for(i=0;i<n;i+=1)
{
for(x=2;x<a[i];x+=1)
{s=m+t;
m=t;
t=s;}
cout<<t<<endl;
m=1,t=1,s=0;
}
return 0;
}
| 61 |
30,451 | int main()
{
int n, i, j, a[100], b[21] = {0, 1, 1};
cin>>n;
for (i = 0; i < n; i++)
{
cin>>a[i];
if (a[i] == 1 || a[i] == 2)
cout<<1<<endl;
else
{
for (j = 3; j <= a[i]; j++)
{
b[j] = b[j - 1] + b[j - 2];
}
cout<<b[j - 1]<<endl;
}
}
return 0;
}
| 61 |
30,452 | int main()
{
int a[100];
a[1]=1;
a[2]=1;
for(int i=3;i<=21;i++)
a[i]=a[i-1]+a[i-2];
int n;
int m;
cin>>n;
while(n--)
{
cin>>m;
cout<<a[m]<<endl;
}
} | 61 |
30,453 | void main()
{
int n,i,j,k;
int str[100]={0};
str[1]=1;
str[2]=1;
int a=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a);
if(a==1||a==2)
printf("1\n");
else
{
for(j=3;j<=a;j++)
str[j]+=str[j-1]+str[j-2];
printf("%d\n",str[a]);
for(k=3;k<=a;k++)
str[k]=0;
}
}
}
| 61 |
30,454 | int f(int i)
{
int t;
if (i==1||i==2)
{
t=1;
}
if(i>2)
{
t=f(i-2)+f(i-1);
}
return t;
}
main()
{
int a[1000];
int n;
int i;
int b;
scanf("%d",&n);
for (i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
for (i=0;i<n;i++)
{
printf("%d\n",f(a[i]));
}
getchar();getchar();getchar();getchar();
}
| 61 |
30,455 | int f(int n)
{
int c;
if(n==1||n==2)
{
c=1;
return c;
}
else
{
c=f(n-1)+f(n-2);
}
return c;
}
main()
{
int a[10000],n,i;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
printf("%d\n",f(a[i]));
}
getchar();
getchar();
}
| 61 |
30,456 | /*
* ??????.cpp
*
* Created on: 2012-10-16
* Author: ???
*/
int main()
{
int a,b,c,n,i,j=3;
cin >> n;
for(i = 1;i <= n;i++)//???????????
{
cin >> c;
if((c ==1)&&(c == 2))
cout << 1;
a = 1;
b = 1;
for(j = 3;j <= c;j = j +2 )//??????????
{
a = a+b;
b = b+a;
}
if(c%2==1)//????a??b?
cout << a<<endl;
if(c%2==0)
cout << b << endl;
}
return 0;
}
| 61 |
30,457 | main()
{
int n,i,a,j;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a);
int b[20]={0};
b[0]=1;
b[1]=1;
if(a<=2)
{
printf("%d\n",b[a-1]);
}
else
{
for(j=2;j<a;j++)
{
b[j]=b[j-1]+b[j-2];
}
printf("%d\n",b[a-1]);
}
}
getchar();
getchar();
}
| 61 |
30,458 | int main(){
int n;
scanf("%d",&n);
int a[30];
int b[30][100];
for(int i=0;i<=29;i++){
b[i][1]=1;
b[i][2]=1;}
for(int i=0;i<n;i++){
scanf("%d",&a[i]);
if((a[i]==1)||(a[i]==2)){
printf("%d\n",b[i][a[i]]=1);}
else{
for(int j=3;j<=a[i];j++){
b[i][j]=b[i][j-1]+b[i][j-2];
}
printf("%d\n",b[i][a[i]]); }
}
scanf("%d",&n);
return 0;}
| 61 |
30,459 | /*
* ???008.cpp
* Created on: 2012-10-14
* Author: ???
* ?????????
*/
int main(){
int n,i=1,j=3; //??n i j???
int b[20]; //????
b[1]=1,b[2]=1; //??????1
while(j<=20){ //????
b[j]=b[j-1]+b[j-2]; //???????
j=j+1; //?j?1
}
cin>>n; //??n
int a[n]; //??????
while(i<=n){ //????
cin>>a[i]; //?????????
cout<<b[a[i]]<<endl; //??????a??
i=i+1; //?i?1
}
return 0; //????
} | 61 |
30,460 | int pb(int n);
int main(){
int i,a,n,k,s[1000];
scanf("%d",&k);
for(i=0;i<k;i++){
scanf("%d",&n);
s[i]=pb(n);
}
for(i=0;i<k;i++){
printf("%d\n",s[i]);
}
return 0;
}
int pb(int m){
int sz[100000];
sz[1]=1;sz[2]=1;
for(int i=3;i<=m;i++){
sz[i]=sz[i-1]+sz[i-2];
}
return sz[m];
} | 61 |
30,461 | int main(){
int n,a,x,y,e;
int i=0,j=0;
int s[21];
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d",&a);
if(a==1||a==2){
y=1;
}
else{
j=0;
for(j=0;j<a-1;j++){
if(j==0){
y=1;
x=1;
}
if(j>0){
e=y;
y=x+y;
x=e;
}
}
}
s[i]=y;
}
i=0;
for(i=0;i<n;i++){
printf("%d\n",s[i]);
}
return 0;
}
| 61 |
30,462 | int F(int,int );
int F( int a , int b )
{
int c = a + b ;
a = b ;
b = c ;
return b ;
}
int main ()
{
int n , i , j , x[101];
cin >> n ;
for ( i = 1 ; i <= n ; i ++)
{
cin >> x[i];
if ( x[i] == 1 )
{
cout << "1" << endl ;
continue ;
}
if ( x[i] == 2 )
{
cout << "1" << endl ;
continue ;
}
int a = 1 , t , b = 1 , sum = 2;
do
{
t = b ;
b = F(a,b);
a = t ;
sum ++ ;
}while (sum < x[i] );
cout << b << endl ;
}
} | 61 |
30,463 | /* ??????????
* ?????2012-10-21
* ???winneshaw
* ????????????????:
* ?????????????1????????????2?????
* ???????a???????????a??????
*/
int main(){
int n;
cin>>n;
int a[20]={0};
a[0]=1;
a[1]=1;
int i=2;
int c=1,d=1;
do {
a[i]=c+d;
c=d;
d=a[i];
i++;
}while(i<20);
int b[20]={-1};
int istep=0;
do{
cin>>b[istep];
istep++;
}while(istep<n);
int m=0;
do{
int e=b[m]-1;
cout<<a[e]<<endl;
m++;
}while(m<n);
return 0;
}
| 61 |
30,464 | //***********************************
//* ?????? *
//* ?????? *
//* ?????2011?10?2? *
//***********************************
int main()
{
int a , x1 , x2 , x3 , i , j , n;
cin >> n;
for(i = 1;i <= n; i = i + 1)
{
cin >> a;//a?????,1<=a<=20
x1 = 1;
x2 = 1;//x1,x2?????????
if(a == 1 || a == 2)
cout << "1" << endl;//???????1?????
else
{
for(j = 1;j <= a - 2;j = j + 1)//?a?????a-1???
{
x3 = x1 + x2;
x1 = x2;
x2 = x3;//????????????
}
cout << x3 << endl;
}
}
return 0;
} | 61 |
30,465 | int Fibonacci (int x);
int main(){
int i,n,p[30];
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d",&p[i]);
}
for(i=0;i<n;i++){
printf("%d\n",Fibonacci (p[i]));
}
return 0;
}
int Fibonacci (int x){
int i,p,q,m,result;
p=1;
q=1;
if(x==1){
result=p;
}
else if(x==2){
result=q;
}
else if(x>2){
for(i=3;i<=x;i++){
m=p+q;
p=q;
q=m;
}
result=q;
}
return result;
}
| 61 |
30,466 |
int main()
{
int n;
cin>>n;
int s[20];
s[0]=s[1]=1;
for(int i=2;i<20;i++)
{
s[i]=s[i-1]+s[i-2];//???????????20???????????
}
int temp;//???????
for(int j=0;j<n;j++)
{
cin>>temp;
cout<<s[temp-1]<<endl;//???????????????
}
return 0;
} | 61 |
30,467 | int f(int n, int a, int b)
{
if (n <= 0)
return a;
return f(n - 1, b, a + b);
}
int main()
{
int n, i, a;
cin >> n;
for (i = 1; i <= n; i++)
{
cin >> a;
cout << f(a - 1, 1, 1) << endl;
}
return 0;
} | 61 |
30,468 |
int fab(int);
int main()
{
int n,a,i;
cin >> n;
for(i=0;i<n;i++)
{
cin >> a;
cout << fab(a) << endl;
}
return 0;
}
int fab(int a)
{
if(a==1)return 1;
else if(a==2)return 1;
else
return fab(a-1)+fab(a-2);
} | 61 |
30,469 | int mem[30]={0,1,1};
int fib(int a)
{
if(a<=2)return 1;
if(mem[a]!=0)return mem[a];
int result;
result=fib(a-1)+fib(a-2);
mem[a]=result;
return result;
}
int main()
{
int n,a,i;
cin>>n;
for(i=1;i<=n;i++)
{
cin>>a;
cout<<fib(a)<<endl;
}
return 0;
}
| 61 |
30,470 | int main()
{
int f(int x);
int num,i,a[10000]={0},b;
scanf("%d", &num);
for(i=1;i<=num;i++)
{
scanf("%d", &b);
a[i]=f(b);
}
for(i=1;i<=num;i++)
{
printf("%d\n", a[i]);
}
return 0;
}
int f(int x)
{
if(x==1 || x==2) return 1;
else
{
int c;
c=f(x-1)+f(x-2);
return c;
}
} | 61 |
30,471 | int main(){
int i=1,j=2,a,n,e,c[100],s[100],w[100];
scanf("%d",&n);
s[0]=1;
for(int t=1;t<=90;t++){
s[t]=i;
e=j;
j=i+j;
i=e;
}
for(int r=0;r<=n-1;r++){
scanf("%d",&c[r]);
w[r]=s[c[r]-1];
}
for(int y=0;y<=n-1;y++){
printf("%d\n",w[y]);
}
return 0;} | 61 |
30,472 | int main()
{
int n,i=0,j=2,p,q,r;
int m[100],t[100];
scanf("%d\n",&n);
for(i=0;i<n-1;i++)
{
scanf("%d\n",&m[i]);
}
scanf("%d",&m[n-1]);
i=0;
for(i=0;i<n;i++)
{
if(m[i]==1||m[i]==2)
{
t[i]=1;
}
if(m[i]>2)
{
p=1;
q=1;
for(j=2;j<m[i];j++)
{
r=q;
q=p+q;
p=r;
}
t[i]=q;
j=2;
}
}
i=0;
for(i=0;i<n-1;i++)
{
printf("%d\n",t[i]);
}
printf("%d",t[n-1]);
return 0;
} | 61 |
30,473 | int f(int n)
{
int c;
if(n==1)
c=1;
else if(n==2)
c=1;
else
c=f(n-1)+f(n-2);
return c;
}
void main()
{
int n,i;
scanf("%d",&n);
int a[100];
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
printf("\n");
}
for(i=0;i<n;i++)
printf("%d\n",f(a[i]));
}
| 61 |
30,474 | int f(int n){
int c;
if (n==1){
c=1;
}
if (n==2){
c=1;
}
if (n>2){
int a=1;
int b=1;
for (int i=1;i<n-1;i++){
c=a+b;
a=b;
b=c;
}
}
return c;
}
int main(){
int n,sz[21],i;
scanf ("%d",&n);
for (i=0;i<n;i++){
scanf ("%d",&sz[i]);
}
for (i=0;i<n;i++){
printf ("%d\n",f(sz[i]));
}
return 0;
} | 61 |
30,475 |
int fibonacci[1000] = {0, 1, 1};
int f(int n)
{
if (fibonacci[n] > 0)
{
return fibonacci[n];
}
return f(n - 1) + f(n - 2);
}
int main()
{
int k, n;
cin >> k;
while (k--)
{
cin >> n;
cout << f(n) << endl;
}
return 0;
} | 61 |
30,476 |
int fib(int finput)
{
int i1,i2,temp,i;
i1=1;
i2=1;
if(finput==1||finput==2)
return 1;
for(i=2;i<finput;i++)
{
temp=i1+i2;
i1=i2;
i2=temp;
}
return i2;
}
int main()
{
int number;
int finput,i;
scanf("%d\n",&number);
for(i=0;i<number;i++)
{
scanf("%d\n",&finput);
if(i!=number-1)
{
printf("%d\n",fib(finput));
}
else
{
printf("%d",fib(finput));
}
}
return 0;
} | 61 |
30,477 | int a[22]={0,1,1};
int fibo(int n){
if(n==1||n==2)return 1;
else if(a[n]==0)a[n]=fibo(n-1)+fibo(n-2);
return a[n];
}
void main()
{
int n,cases;
scanf("%d",&cases);
while(cases--){
scanf("%d",&n);
printf("%d\n",fibo(n));
}
} | 61 |
30,478 | int main()
{
int a[20],b[20],i,n;
a[0]=0,a[1]=1,a[2]=1;
for(i=0;i<=20;i++) a[i+2]=a[i+1]+a[i];
cin>>n;
for(i=0;i<=n-1;i++) cin>>b[i];
for(i=0;i<=n-1;i++) cout<<a[b[i]]<<endl;
return 0;
}
| 61 |
30,479 | int main()
{
int i,n,t,a[21],j;
a[2]=a[1]=1;
cin >> t;
for(i=1;i<=t;i++)
{
cin >> n ;
if(n<=2)
{
cout << 1 << endl;
continue;
}
else
{
for(j=3;j<=n;j++)
a[j] = a[j-1] + a[j-2] ;
}
cout << a[n] << endl ;
}
return 0;
} | 61 |
30,480 |
int main()
{
int n;
int i;
int a[N],b;
a[1]=1;
a[2]=1;
for(i=3;i<=N;i++)
{
a[i]=a[i-1]+a[i-2];
}
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&b);
printf("%d\n",a[b]);
}
return 0;
} | 61 |
30,481 | int main(){
int n,i,m,j,r;
int sz[1000];
int s[1000];
scanf("%d",&n);
for(i=0;i<n;i++){
s[0]=1;
s[1]=1;
scanf("%d",&m);
if(m==1||m==2){
sz[i]=1;
}
else{
for(j=2;j<m;j++){
r=s[j-1]+s[j-2];
s[j]=r;
}
sz[i]=r;
}
}
for(i=0;i<n;i++){
printf("%d\n",sz[i]);
}
return 0;
}
| 61 |
30,482 |
int main()
{
int i;
int a[25];
a[0] = 1;
a[1] = 1;
for(i = 2;i < 25;i++)
{
a[i] = a[i-1]+a[i-2];
}
int n;
int s;
cin >>s;
for(i = 0;i<s;i++)
{
cin >> n;
cout << a[n - 1]<<endl;
}
return 0;
} | 61 |
30,483 |
int main()
{
int i=0,j=0,n;
int a[10000]={0},b[100]={0};
b[0]=1;b[1]=1;
cin >> n;
for(i=0;i<n;i++)
{cin >> a[i];}
for(j=2;j<22;j++)
{b[j]=b[j-1]+b[j-2];}
for(i=0;i<n;i++)
cout << b[a[i]-1] << endl;
return 0;
}
| 61 |
30,484 | int f(int k);
int main(){
int s[1000],i,n,k;
scanf("%d\n",&n);
for(i=0;i<n;i++){
scanf("%d\n",&s[i]);
k=s[i];
printf("%d\n",f(k));
}
return 0;
}
int f(int k){
if(k==1||k==2){
return 1;
}else{
return f(k-1)+f(k-2);
}
} | 61 |
30,485 | /*
* 1.cpp
*
* Created on: 2013-10-11
* Author: ??
*/
int main()
{
int n;
cin >> n;
int a, sj, hc, q1;
for (int i=1;i<=n;i++)
{
q1 = 1;
sj = 1;
cin >> a;
for (int j=3;j<=a;j++)
{
hc = sj;
sj = sj+q1;
q1 = hc;
}
cout << sj << endl;
}
return 0;
}
| 61 |
30,486 | int main(int argc, char* argv[])
{ int a1=1,a2=1,i=0,a,n,e,y=0;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d",&e);
a1=1;
a2=1;
if(e<=2){a=1;}else{
for(y=0;y<e-2;y++){
a=a1+a2;
a1=a2;
a2=a;
}}
printf("%d\n",a);
}
return 0;
}
| 61 |
30,487 | int f(int x)
{
int n;
if(x==1||x==2)
n=1;
else
n=f(x-1)+f(x-2);
return n;
}
main()
{
int n,x;
scanf("%d",&n);
int i,j;
for(i=0;i<n;i++)
{
scanf("%d",&x);
printf("%d\n",f(x));
}
}
| 61 |
30,488 | int F(int n);
int main()
{
int n[1000],a[1000],k,i;
scanf("%d",&k);
for(i=0;i<k;i++){
scanf("%d",&n[i]);
a[i]=F(n[i]);
}
for(i=0;i<k;i++){
printf("%d\n",a[i]);}
return 0;
}
int F(int n){
int f1=1,f2=1,f3=f1+f2,i;
if(n==1){return 1;}
else if(n==2){return 1;}
else{
for(i=2;i<n;i++){
f3=f1+f2;
f1=f2;
f2=f3;
}
return f3;
}
}
| 61 |
30,489 |
int feb(int n)
{
if (n == 1)
return 1;
else
{
if (n == 2)
return 1;
else
return feb(n-1) + feb(n-2);
}
return true;
}
int main()
{
int m, zu, i;
int mem[10000];
cin >> zu;
for (i = 0; i < zu; i ++)
{
cin >> m;
mem[i] = feb(m);
}
for (i = 0; i < zu; i ++)
{
if (i < zu - 1)
cout << mem[i] << endl;
else
cout << mem[i];
}
return 0;
} | 61 |
30,490 |
int main(int argc, char* argv[])
{
int a[100];
int m,n;
a[0]=1;
a[1]=1;
scanf("%d",&m);
for(int i=1;i<=m;i++)
{
scanf("%d",&n);
for(int q=2;q<n;q++)
{
a[q]=a[q-1]+a[q-2];
}
printf("%d\n",a[n-1]);
}
return 0;
}
| 61 |
30,491 | int f(int n)
{ if(n==1||n==2)return 1;
else return f(n-2)+f(n-1);
}
main()
{int n,i,a[100],m;
scanf("%d",&n);
for(i=0;i<n;i++)
{scanf("%d",&a[i]);
printf("%d\n",f(a[i]));
}
getchar();getchar();getchar();
} | 61 |
30,492 | void main()
{
int n,i,d,k,a,b[21],c[21];
b[1]=1; b[2]=1;
scanf("%d\n",&n);
for (i=1;i<=n;i++)
scanf("%d\n",&c[i]);
for (i=1;i<=n;i++)
{
d=c[i];
for (k=3;k<=d;k++)
b[k]=b[k-2]+b[k-1];
printf("%d\n",b[d]);
}
} | 61 |
30,493 | int main(){
int n;
scanf("%d",&n);
for(int i=1;i<=n;i++){
int a;
scanf("%d",&a);
if(a==1||a==2){
printf("1\n");
}else{
int x=1,y=1,z;
for(int m=3;m<=a;m++){
z=x+y;
x=y;
y=z;
}
printf("%d\n",y);
}
}
return 0;
} | 61 |
30,494 | int main(){
int a[20],i,b[20],n;
a[0]=1;a[1]=1; //??????????
for(i=2;i<20;i++){a[i]=a[i-1]+a[i-2];} //???????????a[i]
cin>>n;
for(i=0;i<n;i++){cin>>b[i];cout<<a[b[i]-1]<<endl;} //????????????
return 0;
}
| 61 |
30,495 | /*
* ??????.cpp
*
* Created on: 2012-10-4
* Author:LiMingyang
* ???????????????
*/
int main(){
int i,j,k,n,fei[20];//????
cin>>n;//????????
const int n1=n;//?????n1??????
int a[n1],b[n1];//?????????????
for (i=0;i<n1;i++)
cin>>a[i];//?????????
fei[0]=fei[1]=1;//???????1,2????1
for (j=2;j<=20;j++)
fei[j]=fei[j-1]+fei[j-2];//?????????
b[0]=fei[a[0]];//b[]??????
cout<<fei[a[0]-1];//??????????
for (k=1;k<n1;k++)
{
b[k]=fei[a[k]-1];
cout<<endl<<b[k];//????????????
}
} | 61 |
30,496 |
void main()
{
int fb(int a);
int n,a,m,i;
scanf("%d",&n);
for(i=1;i<=n;i++)
{scanf("%d",&a);
m=fb(a);
printf("%d\n",m);}
}
int fb(int a)
{
int k,sl[20],x;
sl[1]=1;
sl[2]=1;
for(k=3;k<=a;k++)
{sl[k]=sl[k-2]+sl[k-1];}
x=sl[a];
return(x);
} | 61 |
30,497 | /*
* Fibonacci.cpp
*
* Created on: 2012-10-17
* Author: Cui Zhaoxiong Class4 1200012931
*/
int main(){
int array[20];
array[0]=1;
array[1]=1;
for (int i=2;i<20;i++){
array[i]=array[i-1]+array[i-2];
} //????????
int n=0;
cin >>n;
for (int i=1;i<=n;i++){
int p=0;
cin >>p;
cout <<array[p-1] <<endl; //??????????
}
return 0;
}
| 61 |
30,498 | main()
{
int n,i,a[20],j,f[21];
scanf("%d\n",&n);
for(i=0;i<n;i++)
{scanf("%d",&a[i]);}
f[1]=1;
f[2]=1;
for(j=3;j<=20;j++)
{f[j]=f[j-1]+f[j-2];}
for(i=0;i<n;i++)
{
printf("%d\n",f[a[i]]);}
getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();
}
| 61 |
30,499 |
int sum[21] = {0};
void calculate (int t);
int main()
{
int n, i, a;
cin >> n;
sum[1] = sum[2] = 1;
calculate (3);
for (i = 1; i <= n; i++)
{
cin >> a;
cout << sum[a] << endl;
}
return 0;
}
void calculate (int t)
{
if (t <= 21)
{
sum[t] = sum[t - 1] + sum[t - 2];
calculate (t + 1);
}
} | 61 |
Subsets and Splits