id
int32 0
32.5k
| code
stringlengths 95
8.4k
| label
stringclasses 65
values |
|---|---|---|
30,100 | int main(){
int n,i=0;
cin>>n;
int iNum[n-1];
while(i<=(n-1)){
cin>>iNum[i];
i=i+1;
}
i=0;
while(i<=(n-1)){
int x1=1,x2=1,x3,j=3;
if(iNum[i]<=2){
cout<<1;
}
else {
while(j<=iNum[i]){
x3=x2+x1;
x1=x2;
x2=x3;
j=j+1;
}
cout<<x2<<endl;
}
i=i+1;
}
return 0;
}
| 61 |
30,101 | int main()
{
int n;
int a[21];
a[1]=1;
a[2]=1;
for(int i=3;i<=20;i++)
a[i]=a[i-1]+a[i-2];
scanf("%d",&n);
int b[n];
for(int i=0;i<n;i++)
{ scanf("%d",&b[n]);
printf("%d\n",a[b[n]]);}
getchar();
getchar();
}
| 61 |
30,102 | int p(int m)
{
int i,a[22];
a[1]=1;
a[2]=1;
if(m>2)
{
for(i=3;i<=m;i++)
{
a[i]=a[i-1]+a[i-2];
}
}
return a[m];
}
int main()
{
int m,n,i;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&m);
printf("%d\n",p(m));
}
return 0;
} | 61 |
30,103 | int f(int);
int main()
{
int n;
cin >> n;
for(int i=0; i < n; i++)
{
int a;
cin>>a;
cout<<f(a)<<endl;
}
}
int f(int x)
{
if(x==1)
{
return 1;
}
if(x == 2)
{
return 1;
}
return f(x-1)+f(x-2);
} | 61 |
30,104 | int f(int af)
{
if(af == 1 || af == 2)
return 1;
return f(af-1) + f(af-2);
}
int main()
{
int n, m, k;
cin >> n;
for (int i = 1; i <= n; i++)
{
cin >> k;
m = f(k);
cout << m << endl;
}
return 0;
} | 61 |
30,105 |
int main()
{
int a,b[30],n,i=0,j=2,sum=2;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a);
b[0]=1;
b[1]=1;
for(j=2;j<a;j++)
{
b[j]=b[j-1]+b[j-2];
}
printf("%d\n",b[j-1]);
}
return 0;
}
| 61 |
30,106 | int main()
{
int a,b,i,j,n,c;cin>>n;
for(j=1;j<=n;j++)
{
a=1;b=1;cin>>c;
for(i=1;i<=c/2;i++)
{
a=a+b;b=a+b;}
if(c%2==0) cout<<b-a<<endl;
else cout<<a<<endl;
}
return 0;
} | 61 |
30,107 | int main(){
int n,a[20],b[20],i,j,k,result[20];
scanf("%d",&n);
for(i=0;i<=n-1;i++){
scanf("%d",&a[i]);
}
result[0]=1;
result[1]=1;
for(k=1;k<=n;k++){
if(a[k-1]>=3){
for(j=2;j<=a[k-1]-1;j++){
result[j]=result[j-1]+result[j-2];
}
b[k-1]=result[a[k-1]-1];
printf("%d\n",b[k-1]);
}else if(a[k-1]==1||a[k-1]==2){
printf("1\n");
}
}
return 0;
} | 61 |
30,108 |
int change(int a, int b, int t, int k)
{
if (t == k)
return(a + b);
else
change(b, a + b, t, k + 1);
}
int main()
{
int n, m;
cin >> n;
for (int i = 1;i <= n;i++)
{
cin >> m;
if (m == 1 || m == 2)
cout << 1 << endl;
else
cout << change(1, 1,m - 2, 1) << endl << endl;
}
return 0;
} | 61 |
30,109 | int main(){
int n;
scanf("%d",&n);
int a[20];
int i,m,r,s,t;
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{
r=sz[i-1];
s=sz[i-2];
t=r+s;
sz[i]=t;
}
}
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,110 | //2013.11.23
//zwb
int n, i, j = 1, m;
int num[21] = {0};
int fib(int m)
{
if(m == 1 || m == 2)
return 1;
else
return fib(m - 1) + fib(m - 2);
}
int main ()
{
cin >> n;
for(i = 1; i <= n; i++)
{
cin >> m;
num[m] = fib(m);
cout << num[m] << endl;
}
return 0;
}
| 61 |
30,111 | int main (){
int n,i,a,j,b[100];
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d",&a);
for(j=0;j<100;j++){
if(j==0||j==1){b[j]=1;}
else {b[j]=b[j-1]+b[j-2];}
}
printf("%d\n",b[a-1]);
}
return 0;
} | 61 |
30,112 | int a[30] = {0};
int fibo(int n)
{
if(a[n] != 0)
return a[n];
return fibo(n-1)+fibo(n-2);
}
int main()
{
a[1] =1;
a[2] = 1;
int n;
cin>>n;
while(n--)
{
int k;
cin>>k;
cout<<fibo(k)<<endl;
}
return 0;
} | 61 |
30,113 | int bo(int x);
int main(){
int m;
scanf("%d",&m);
int i;
for(i=0;i<m;i++){
int n,c;
scanf("%d",&n);
c=bo(n);
printf("%d\n",c);
}
return 0;
}
int bo(int x){
double b,p,q,P,Q,result;
b=sqrt(5);
p=(1+b)/2;
q=(1-b)/2;
P=pow(p,x);
Q=pow(q,x);
result=(P-Q)/b;
return result;
}
| 61 |
30,114 | int s(int n);
int main()
{
int n[1000],k,j;
scanf("%d",&k);
for(j=0;j<k;j++){
scanf("%d",&n[j]);
}
for(j=0;j<k;j++){
printf("%d\n",s(n[j]));
}
return 0;
}
int s(int n){
int x,y,z,i;
scanf("d",&n);
x=1;
y=1;
z=x+y;
for(i=3;i<n;i++){
x=y;
y=z;
z=x+y;
}
if(n<3){
z=1;
}
return z;
}
| 61 |
30,115 | int main()
{
int b,d[100],i=0;
int a[21]={1,1,2,3,5,8,13,21,34,55,89,144,233,377,610,987,1597,2584,4181,6765};
scanf("%d",&b);
for(i=0;i<b;i++)
{
scanf("%d",&d[i]);
}
i=0;
for(i=0;i<b;i++)
{
printf("%d\n",a[d[i]-1]);
}
return 0;
} | 61 |
30,116 | int dijigeshu(int a);
int main(){
int x=1,y=1;
int n,a,b[100];
scanf("%d",&n);
for(int i=0;i<n;i++){
scanf("%d",&a);
b[i]=dijigeshu(a);
}
for(int j=0;j<n;j++){
printf("%d\n",b[j]);
}
return 0;
}
int dijigeshu(int a){
int x=1,y=1,s;
if(a==1||a==2){
return 1;
}else{
for(int j=3;j<=a;j++){
s=x+y;
x=y;
y=s;
}
return s;
}
}
| 61 |
30,117 | 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,i,sz[20];
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,118 | int main()
{
int n,a[20],b[20],i,m,e;
b[0]=1;
b[1]=1;
m=0;
scanf("%d",&n);
i=0;
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
for(i=0;i<n;i++)
{
if((a[i]==1)||(a[i]==2))
{
m=1;
printf("%d\n",m);
}
else
{
m=2;
for(m=2;m<a[i];m++)
{
b[m]=b[m-1]+b[m-2];
e=b[m];
}
printf("%d\n",e);
}
}
return 0;
} | 61 |
30,119 | int feibo(int a)
{
if(a==1)return 1;
if(a==2)return 1;
if(a!=1&&a!=2)return feibo(a-1)+feibo(a-2);
}
int main()
{
int n,i,a,number[100]={0};
number[1]=1;
number[2]=1;
cin >> n;
for(i=1;i<=n;i++)
{
cin>> a;
cout<<feibo(a)<<endl;
}
return 0;
} | 61 |
30,120 | /*
* ??????.cpp
*
* Created on: 2013-10-11
* Author: 111
*/
int main()
{
int f[21],n,i,a[20]; //???????a[20]?????????f[20]
cin>>n;
f[1]=1;f[2]=1;
for (i=3;i<=20;i++)
f[i]=f[i-1]+f[i-2]; //?????????
for (i=1;i<=n;i++)
{
cin>>a[i]; //????n??
a[i]=f[a[i]]; //?a[i]???????
}
for (i=1;i<=n;i++)
{
cout<<a[i]<<endl; //????
}
}
| 61 |
30,121 | main()
{
int a[101],i,n,c=0;
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%d",&a[i]);
c++;
}
int b[101];
b[1]=1;
b[2]=1;
for(i=3;i<=100;i++)
{
b[i]=b[i-1]+b[i-2];
}
for(i=1;i<=c;i++)
{
printf("%d\n",b[a[i]]);
}
}
| 61 |
30,122 | int main()
{
int n, i, a, j, f[21] = {0, 1, 1};
cin >> n;
for (i = 0; i < n; i++)
{
cin >> a;
if (a == 1 || a == 2)
{
cout << 1 << endl;
continue;
}
for (j = 2; j < a; j++)
f[j + 1] = f[j] + f[j - 1];
cout << f[j] << endl;
}
return 0;
} | 61 |
30,123 | int f(int n){
int result;
if(n==1||n==2) return 1;
else{
result=f(n-1)+f(n-2);
return result;
}
}
int main(){
int n,t,i;
scanf("%d",&t);
for(i=0;i<t;i++){
scanf("%d",&n);
printf("%d\n",f(n));
}
scanf("%d",&n);
return 0;
}
| 61 |
30,124 | int f(int a)
{
int d[20]={1,1};
int i;
for(i=2;i<a;i++)
d[i]=d[i-1]+d[i-2];
return(d[a-1]);
}
int main()
{
int a[20],i,z[20],n;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
for(i=0;i<n;i++)
{
z[i]=f(a[i]);
printf("%d\n",z[i]);
}
return 0;
} | 61 |
30,125 | int f(int n)
{
int i;
int A[20];
A[1]=1;
A[2]=1;
for(i=3;i<=n;i++)
{
A[i]=A[i-1]+A[i-2];
}
return A[n];
}
int main()
{
int n,i,p,s;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&p);
s=f(p);
printf("%d\n",s);
}
return 0;
}
| 61 |
30,126 | int main()
{
int a, n;
cin >> n;
while (n --)
{
cin >> a;
if (a == 1)
cout << 1 << endl;
else if (a == 2)
cout << 1 << endl;
else
{
int a1, a2, a3;
a1 = 1;
a2 = 1;
for (int i = 3; i <= a; i ++)
{
a3 = a1 + a2;
a1 = a2;
a2 = a3;
}
cout << a3 << endl;
}
}
return 0;
} | 61 |
30,127 | int main()
{
int i,j,n,a[1000],m;
a[1]=1;
a[2]=1;
for (i=3;i<30;i++)
a[i]=a[i-1]+a[i-2];
scanf("%d",&n);
for (i=0;i<n;i++)
{
scanf("%d\n",&m);
printf("%d\n",a[m]);
}
}
| 61 |
30,128 | int f(int n);
int main(){
int n,j,a;
scanf("%d",&n);
for(j=0;j<n;j++){
scanf("%d",&a);
printf("%d\n",f(a));
}
return 0;
}
int f(int n){
int i,sz[1000],result;
sz[0]=1;
sz[1]=1;
for(i=2;i<=n;i++){
sz[i]=sz[i-1]+sz[i-2];
}
result=sz[n-1];
return result;
} | 61 |
30,129 | int f(int n)
{
if(n==1||n==2)
return 1;
else
return f(n-1)+f(n-2);
}
main()
{
int m,i=1;
scanf("%d",&m);
int a[10000];
for(i=1;i<=m;i++)
scanf("%d",&a[i]);
for(i=1;i<=m;i++)
printf("%ld\n",f(a[i]));
getchar();
getchar();
}
| 61 |
30,130 | int f(int x)
{
int c;
if(x==1||x==2)
c=1;
if(x>2)
c=(f(x-1)+f(x-2));
return c;
}
void main()
{
int a[999],n,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]));
}
}
| 61 |
30,131 | int main()
{
double a=1,b=1,c;
int i,n,j,x;
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%d",&x);
a=1;
b=1;
for(j=3;j<=x;j++)
{ c = b;
b = a+b;
a = c;
}
printf("%.0lf\n",b);
}
return 0;
} | 61 |
30,132 | int F(int n);
int main(){
int n,m,result;
scanf("%d", &m);
for(int k=0;k<m;k++){
scanf("%d", &n);
result = F(n);
printf("%d\n", result);
}
return 0;
}
int F(int n){
int c=0;
if(n==0) return 0;
if(n==1||n==2) return 1;
if(n>2){
int a=1,b=1,c=0;
for(int i=2;i<n;i++){
c=a+b;
a=b;
b=c;
}
return c;}
} | 61 |
30,133 | int fab(int num); //??fab??
int main() //?????
{
int n,i; //??????n,i,n???????i?????
int num;
cin>>n;
for(i=1;i<=n;i++) //??n?????????????
{
cin>>num;
cout<<fab(num)<<endl;
}
return 0;
}
int fab(int num) //??fab??
{
if(num==1) //??????1
{return 1;}
if(num==2) //??????1
{return 1;}
if(num!=1&&num!=2) //????
{return fab(num-1)+fab(num-2);}
} | 61 |
30,134 | main()
{
int a[100];
int n,m;
int i,j;
int k;
scanf("%d",&n);
for (i=0;i<n;i++)
{
scanf("%d",&m);
if (m==1 || m==2)
{
if (i==0)
printf("1\n");
else
printf("\n1\n");
}
else
{
a[0]=1;
a[1]=2;
for (j=2;j<m-1;j++)
{
a[j]=a[j-1]+a[j-2];
}
if (i==0)
printf("%d\n",a[m-2]);
else
printf("\n%d\n",a[m-2]);
}
}
} | 61 |
30,135 | int main(){
int i,j,n,zu;
int fei[50],a[50];
scanf("%d",&zu);
for(i=1;i<=zu;i++){
scanf("%d",&n);
a[i]=n;
}
fei[1]=1;
fei[2]=1;
for(i=3;i<=20;i++){
fei[i]=fei[i-1]+fei[i-2];
}
for(i=1;i<=zu;i++){
printf("%d\n",fei[a[i]]);
}
scanf("%d\n",&fei[a[i]]);
return 0;
} | 61 |
30,136 | int main()
{
int s[50],n,i,j,p,q,a;
cin>>n;
for(i=1;i<=n;i++)
cin>>s[i];
for(i=1;i<=n;i++)
{
p=0;
q=1;
if(s[i]==1)
q=1;
if(s[i]>1)
{
for(j=2;j<=s[i];j++)
{
a=p;
p=q;
q=q+a;
}
}
cout<<q<<endl;
}
return 0;
}
| 61 |
30,137 | int main () {
int n,i,j,a,b,t;
int p[1000];
int s;
scanf ("%d",&n);
for (i=0;i<n;i++){
scanf ("%d",&p[i]);
}
for (i=0;i<n;i++){
if (p[i]==1||p[i]==2){
printf ("1\n");
}
else {
s=0;a=1;b=1;
for (j=1;j<=p[i]-2;j++){
s=a+b;
t=b;
b=s;
a=t;
}
printf ("%d\n",s);
}
}
return 0;
} | 61 |
30,138 | int main()
{ int N;
cin>>N;
int i;
int A[20];
A[0]=1;
A[1]=1;
for(i=2;i<20;i++)
{
A[i]=A[i-1]+A[i-2];
}
int j;
int a;
for(j=0;j<N;j++)
{
cin>>a;
if(a>=1&&a<=20)
cout<<A[a-1]<<endl;
}
return 0;
} | 61 |
30,139 | int main()
{
int n,i,j;
int a[20];
int b[1000];
int c[1000];
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d",&b[i]);
}
for(i=0;i<n;i++){
c[i]=0;
}
for(i=0;i<n;i++){
if(b[i]==1||b[i]==2){
c[i]=1;
}else if(b[i]>2){
for(j=3;j<=b[i];j++){
a[1]=1;
a[2]=1;
a[j]=a[j-1]+a[j-2];
c[i]=a[j];
}
}
}
for(i=0;i<n;i++){
printf("%d\n",c[i]);
}
return 0;
}
| 61 |
30,140 | 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,i,a[10000];
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();
return 0;
}
| 61 |
30,141 |
int f(int i, int j)
{
int k;
k = i + j;
return k;
}
int main ()
{
int n,a,b,c,i,j,k;
cin >> n;
for (b = 1; b<= n; b++)
{
cin >> a;
if (a == 1 || a == 2)
cout << "1" << endl;
else
{
i = 1;
j = 1;
for (c = 2; c < a; c++)
{
k = f(i,j);
i = j;
j = k;
}
cout << j << endl;
}
}
return 0;
} | 61 |
30,142 | int main(){
int n,i,k,a[100000],f[100000]={1,1};
scanf("%d",&n);
for(k=0;k<n;k++){
scanf("%d",&a[k]);
for(i=2;i<=a[k];i++){
f[i]=f[i-2]+f[i-1];
}
printf("%d\n",f[a[k]-1]);
}
scanf("%d",&n);
return 0;
}
| 61 |
30,143 |
int fibonacci[1000] = {0, 1, 1};
int f(int n)
{
if (fibonacci[n] > 0)
{
return fibonacci[n];
}
fibonacci[n] = f(n - 1) + f(n - 2);
return fibonacci[n];
}
int main()
{
int k, n;
cin >> k;
while (k--)
{
cin >> n;
cout << f(n) << endl;
}
return 0;
} | 61 |
30,144 | int fib(int n)
{
if (n<=1)
return n;
else
return fib(n-2)+fib(n-1);
}
main()
{
int n;
scanf ("%d",&n);
int a;
for (int i=0;i<n;i++)
{
scanf ("%d",&a);
printf ("%d\n",fib(a));
}
} | 61 |
30,145 | int f(int x)
{
if(x==1)return 1;
else if(x==2)return 1;
else
return f(x-2)+f(x-1);
}
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]));
}
| 61 |
30,146 | /*??
?????????????: ?????????????1????????????2?????
???????a???????????a?????? */
/*????
?1?????????n?????n???????????1?????????a(1 <= a <= 20)
????
n????????????????????????????????a?????*/
int WWW(int x);
int main()
{
int n;
cin>>n;
int a[n];
for(int i=0;i<n;i=i+1)
{ cin>>a[i];}
for(int i=0;i<n;i=i+1)
{int b;
b=WWW(a[i]);
cout<<b<<endl;}
return 0;
}
int WWW(int x)
{ int p=1,q;
for(int y=0,z=1,i=0;i<x-1;i=i+1)
{
p=y+z;
y=z;
z=p;}
q=p;
return q;
} | 61 |
30,147 |
int Fibonacci(int x);
int main(){
int n,s,k,a[25];
scanf("%d",&n);
for(k=0;k<n;k++){
scanf("%d",&a[k]);
}
for(k=0;k<n;k++){
s=Fibonacci(a[k]);
printf("%d\n",s);
}
return 0;
}
int Fibonacci(int x){
int result,i,a=1,b=1,c;
if(x<=2){
result=1;
}else{
for(i=3;i<=x;i++){
result=a+b;
c=b;
b=result;
a=c;
}
}
return result;}
| 61 |
30,148 | main()
{
int i,n;
scanf("%d",&n);
int a[n];
int b[20];
b[0]=1;
b[1]=1;
for (i=2;i<20;i++)
b[i]=b[i-1]+b[i-2];
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
printf("%d\n",b[a[i]-1]);
}
}
| 61 |
30,149 | int Fib(int n)
{
int ans;
if(n==0) ans = 0;
else if(n==1) ans = 1;
else ans = Fib(n-1)+Fib(n-2);
return ans;
}
main()
{
int n,num,i;
scanf("%d",&num);
for(i=0;i<num;i++)
{
scanf("%d",&n);
printf("%d\n",Fib(n));
}
} | 61 |
30,150 | int main()
{
int n;
cin>>n;
while(n--)
{
int a=0,b=1,c,num,re=0;
cin>>num;
num--;
while(num--)
{
c=b;
b=a+b;
a=c;
}
cout<<b<<endl;
}
return 0;
} | 61 |
30,151 | int he(int x);
int main()
{
int n,a;
scanf("%d",&n);
for(int i=0;i<n;i++)
{
scanf("%d",&a);
printf("%d\n",he(a));
}
return 0;
}
int he(int x)
{
if(x==1){ return 1;}
if(x==2){ return 1;}
int sz[20],e;
sz[0]=1;sz[1]=1;
for(e=3;e<=x;e++)
{
sz[e-1]=sz[e-2]+sz[e-3];}
return sz[x-1];
} | 61 |
30,152 | int main()
{
int num=0, n=0, i=0, j=0, p=1, q=1, temp=0, a;
scanf("%d", &n);
for(i=0; i<n; i++)
{
scanf("%d", &num);
if(num == 1 || num == 2)
printf("1\n");
else
{
for(j=3; j<=num; j++)
{
a=p+q;
p=q;
q=a;
}
printf("%d\n", a);
a=0;
p=1;
q=1;
}
}
return 0;
} | 61 |
30,153 | /*
* 8.cpp
*??????
* Created on: 2012-10-15
* Author: ???
*/
int main()
{
int n,a;//????
cin>>n;//??
for(int i=1;i<=n;i++)//??for??
{
cin>>a;
int x1=1,x2=1,t;
for(int k=2;k<a;k++)//??for??
{
t=x2;
x2=x2+x1;
x1=t;//?????????????????
}
cout<<x2<<endl;//??
}
}
| 61 |
30,154 | //?? - ??????
int main()
{
int f(int);
int n;
int a;
int i,j;
scanf("%d",&n);
printf("\n");
for(i=0;i<n;i++)
{
scanf("%d",&a);
printf("%d\n\n",f(a));
}
return 0;
}
int f(int a)
{
if(a==1)return 1;
if(a==2)return 1;
else return f(a-1)+f(a-2);
}
| 61 |
30,155 | int main()
{
int n;
scanf("%d",&n);
int dijige[20];
for(int i=0;i<=n-1;i++)
{
scanf("%d",&(dijige[i]));
}
int q[30];
q[0]=1;
q[1]=1;
for(int k=2;k<=25;k++)
{
q[k]=q[k-1]+q[k-2];
}
for(int j=0;j<=n-1;j++)
{
printf("%d\n",q[dijige[j]-1]);
}
return 0;
}
| 61 |
30,156 | long t(int u)
{
if(u == 1)
return 1 ;
else if(u == 2)
return 1 ;
else return (t(u-1)+t(u-2));
}
int main()
{
int n , u , i;
cin >> n ;
for (i = 0 ; i < n ;i++)
{
cin >> u ;
cout << t(u)<<endl ;
}
return 0 ;
}
| 61 |
30,157 | int num[MAX] = {0};
int f(int x)
{
if( x == 1 || x == 2)
return 1;
return f(x-1) + f(x-2);
}
int main()
{
int n = 0 ;
cin>> n;
while(n--)
{
int a = 0;
cin>>a;
cout<< f(a) <<endl;
}
return 0;
} | 61 |
30,158 | int main()
{
int n,a,r=1,b,c,d,z,temp;
cin>>n;
for(r=1;r<=n;r++)
{
cin>>a;
b=c=1;
for(temp=1;temp<=a;temp++)
{
z=b;
d=b+c;
b=c;
c=d;
}
cout<<z<<endl;
}
return 0;
}
| 61 |
30,159 |
int fibo(int, int, int);
int main()
{
int n, a;
cin >> n;
for (int i = 1; i <= n; i++)
{
cin >> a;
cout << fibo(a, 1, 1) << endl;
}
return 0;
}
int fibo(int a, int b, int e)
{
if (a <= 2)
return e;
else
fibo(a - 1, e, b + e);
}
| 61 |
30,160 | int f(int x)
{
if (x > 2)
return (f(x - 1) + f(x - 2));
if (x == 1)
return 1;
if (x == 2)
return 1;
}
int main()
{
int n, x;
cin >> n;
for (int i = 0; i < n; i++)
{
cin >> x;
cout << f(x) << endl;
cout << endl;
}
return 0;
} | 61 |
30,161 |
int main(){
int n,i,a,d,k,p,q;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d",&a);
p=1;
q=1;
if(a==1||a==2){
printf("%d\n",q);
}
else if(a>2){
for(k=0;k<a-2;k++){
d=p+q;
p=q;
q=d;
}
printf("%d\n",q);
}
}
return 0;
} | 61 |
30,162 |
int f(int);
int main()
{
int n;
cin >> n;
while(n--)
{
int a;
cin >> a;
cout << f(a) << endl;
}
return 0;
}
int f(int x)
{
if (x == 1 || x == 2) return 1;
return f(x - 1) + f(x - 2);
} | 61 |
30,163 |
int main(int argc, char* argv[])
{
int sz[100];
int m;
int sum=0;
scanf("%d",&m);
int shuru[100];
for(int i=0;i<m;i++)
{
scanf("%d",&(shuru[i]));
}
for(int h=0;h<m;h++)
{
for(int j=0;j<shuru[h];j++)
{
if(j<=1)
{
sz[j]=1;
}
if(j>=2)
{
sz[j]=sz[j-1]+sz[j-2];
}
sum=sz[j];
}
printf("%d\n",sum);
}
return 0;
} | 61 |
30,164 | int F(int x)
{
int k,t,a[25];
a[1]=1;
a[2]=1;
if(x<3)
{
t=a[x];
return t;
}
else
{
for(k=3;k<21;k++)
{
a[k]=a[k-1]+a[k-2];
}
t=a[x];
return t;
}
}
int main()
{
int n,a,i;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a);
printf("%d\n",F(a));
}
return 0;
} | 61 |
30,165 | int main()
{
int f[100],s[100],n,i;
cin >>n;
int a,b;
a=1;
b=1;
f[0]=a;
f[1]=b;
for( i=0;i<n;i++)
{
cin >>s[i];
}
for(int j=2;j<100;j++)
{
f[j]=f[j-1]+f[j-2];
}
for( i=0;i<n;i++)
{
a=s[i];
cout <<f[a-1]
<<endl;
}
return 0;
}
| 61 |
30,166 | int main(){
int a,b,c,i,j,n;
int z[100],m[100];
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d",&z[i]);
a=1;
b=1;
if(z[i]==1){
m[i]=1;
}else{
if(z[i]==2){m[i]=1;}
else{for(j=0;j<(z[i]-2);j++){m[i]=a+b;a=b;b=m[i];}}}}
for(i=0;i<n;i++){
printf("%d\n",m[i]);
}
return 0;
}
| 61 |
30,167 | int a(int n)
{
int i=1,j=1,k,x=1;
if(n==1||n==2)
return(1);
else
{
for(k=0;k<n-2;k++)
{
x=i+j;
i=j;
j=x;
}
return(x);
}
}
main()
{
int n,i,j;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&j);
printf("%d\n",a(j));
}
getchar();
getchar();
}
| 61 |
30,168 | int main(){
int n,u[1000],i,a1,a2,a,j;
scanf("%d",&n);
for(i=0;i<n;i++){scanf("%d",&u[i]);}
for(i=0;i<n;i++){a1=1;a2=1;
for(j=1;j<=u[i];j++){if(j==1||j==2){a=1;}
else{a=a1+a2;a1=a2;a2=a;}
}printf("%d\n",a);
}
return 0;
} | 61 |
30,169 |
int main ()
{
int f[21];
f[0] = 1;
f[1] = 1;
f[2] = 1;
for (int i = 3; i <= 20; i ++)
{
f[i] = f[i-1] + f[i-2];
}
int n;
cin >> n;
for (int i = 0; i < n; i ++)
{
int a;
cin >> a;
cout << f[a] << endl;
}
return 0;
} | 61 |
30,170 | int main(){
int a,b,c,n,i,d,j;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d",&d);
a=1;b=1;
if(d<3){printf("1\n");break;}
for(j=3;j<=d;j++){
c=a+b;
a=b;
b=c;
}
printf("%d\n",c);
}
return 0;
}
| 61 |
30,171 |
int b[21];
void cal(){
b[0] = 1;
b[1] = 1;
for(int i = 2 ;i <= 20;i++){
b[i] = b[i - 1] + b[i - 2];
}
}
int main(){
int a,n;
cal();
cin>>n;
while(n--){
cin>>a;
cout<<b[a -1]<<endl;
}
return 0;
} | 61 |
30,172 | int p(int m)
{
if(m==1)return 1;
else if(m==2)return 1;
else return p(m-1)+p(m-2);
}
int main()
{
int n;
cin>>n;
int a[n];
for(int i=0;i<n;i++)cin>>a[i];
for(int i=0;i<n;i++)cout<<p(a[i])<<endl;
return 0;}
| 61 |
30,173 | int main()
{
int i,j,k,m=0,h=0;
int f[20]={1,1};
int a[20]={0};
int b[20]={0};
int n;
for(i=2;i<20;i++)
{
f[i]=f[i-2]+f[i-1];
}
for(i=0;i<20;i++)
{
a[i]=f[i];
}
scanf("%d",&n);
for(j=0;j<n;j++)
{
scanf("%d",&b[j]);
}
for(k=0;k<n;k++)
{
m=b[k];
h=a[m-1];
printf("%d\n",h);
}
return 0;
}
| 61 |
30,174 | int F(int a);
int main()
{
int n,a,i,sz[20],result;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d",&a);
result=F(a);
printf("%d\n",result);
}
return 0;
}
int F(int a){
int result,i,st[20];
st[0]=0;
st[1]=1;
for(i=2;i<=a;i++){
st[i]=st[i-1]+st[i-2];
}
result=st[a];
return result;
} | 61 |
30,175 | int main(){
int n,a;
int sz[20];
scanf("%d",&n);
for(int hang=1;hang<=n;hang++){
scanf("%d",&a);
sz[0]=1;
sz[1]=1;
for(int i=2;i<a;i++){
sz[i]=sz[i-1]+sz[i-2];
}
printf("%d\n",sz[a-1]);
}
return 0;
}
| 61 |
30,176 | void main()
{
int i,m,n,a[20]={1,1,2,3,5,8,13,21,34,55,89,144,233,377,610,987,1597,2584,4181,6765};
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&m);
printf("%d\n",a[m-1]);
}
} | 61 |
30,177 | /*
* shulie.cpp
*
* Created on: 2012-10-17
* Author: Justin
*/
int main(){
int n,m;
int a1,a2;
cin>>n;
a1=a2=1;
while(n>0){
cin>>m;
while(m>2){ //?????????M??m??2???1
a2=a2+a1;
a1=a2-a1;
m=m-1;
}
cout<<a2<<endl;
n=n-1;
a1=1;//?????
a2=1;
}
return 0;
} | 61 |
30,178 |
int main()
{
int a[21]={0,1,1};
int N=0,n=0,i=0;
cin>>N;
for(i=3;i<=20;i++)
a[i]=a[i-1]+a[i-2];
for(i=1;i<=N;i++)
{
cin>>n;
cout<<a[n]<<endl;
}
return 0;
}
| 61 |
30,179 | main()
{
int n,a[1000];
a[0]=1;a[1]=1;
scanf("%d",&n);
int s[n];
for(int i=0;i<n;i++)
{
scanf("%d",&s[i]);
if(s[i]==1||s[i]==2)printf("%d",a[1]);
else
{for(int j=2;j<s[i];j++)
{a[j]=a[j-1]+a[j-2];
if(j==s[i]-1) printf("%d\n",a[j]);}}
}}
| 61 |
30,180 | int main()
{
int n,m;
int i,j,k;
int a[100];
scanf("%d",&n);
for(i=1;i<=n;i++)
scanf("%d",&a[i-1]);
int b[100];
b[1]=1;
b[0]=1;
for(i=2;i<=22;i++)
b[i]=b[i-1]+b[i-2];
for(i=0;i<n;i++)
{
m=a[i];
printf("%d\n",b[m-1]);
}
getchar();
getchar();
getchar();
getchar();
getchar();
} | 61 |
30,181 | int main()
{
int *a;
int n,i;
int f(int x);
scanf("%d",&n);
a=(int *)malloc(n*sizeof(int));
for(i=0;i<n;i++)
scanf("%d",&a[i]);
for(i=0;i<n;i++)
{
printf("%d\n",f(a[i]));
}
}
int f(int x)
{
if(x==1||x==2)
return(1);
else
return(f(x-1)+f(x-2));
}
| 61 |
30,182 | int main()
{
int n, k;
int a, b, c;
int i, j;
cin >> n;
for (i = 0; i < n; i++)
{
a = b = 1;
cin >> k;
if (k == 1 || k == 2)
cout << "1" << endl;
for (j = 3; j <= k; j++)
{
if (j % 3 == 0)
{
c = a + b;
if (j == k)
cout << c << endl;
}
if (j % 3 == 1)
{
a = b + c;
if (j == k)
cout << a << endl;
}
if (j% 3 == 2)
{
b = a + c;
if (j == k)
cout << b << endl;
}
}
}
return 0;
}
| 61 |
30,183 | int F(int m)
{
if(m==1||m==2) return 1;
else
{return F(m-1)+F(m-2);}
}
int main()
{int Z,a[23],i;
cin>>Z;
for(i=1;i<=Z;i++)
{cin>>a[i];
}
for(i=1;i<=Z;i++)
{cout<<F(a[i])<<endl;
}
return 0;
}
| 61 |
30,184 | int F(int n){
int a,b,i,s;
if(n==1){s=1;}
else if(n==2){s=1;}
else {
a=1;
b=1;
for(i=3;i<=n;i++){
s=a+b;
a=b;
b=s;}}
return s;
}
int main(){
int a[10000],i,n;
scanf("%d",&n);
for(i=1;i<=n;i++){
scanf("%d",&a[i]);}
for(i=1;i<=n;i++){
printf("%d\n",F(a[i])); }
return 0;
} | 61 |
30,185 | main()
{
int a[21],i,n,b[21];
a[1]=1;
a[2]=1;
for(i=3;i<=20;i++)
{
a[i]=a[i-1]+a[i-2];
}
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%d",&b[i]);
}
for(i=1;i<=(n-1);i++)
{
printf("%d\n",a[b[i]]);
}
printf("%d",a[b[n]]);
}
| 61 |
30,186 | int main()
{
int l,m,n,k,i,j,p,q;
int s[30]={0};
scanf("%d",&n);
s[1]=1;s[2]=1;
for (i=3;i<=25;i++)
s[i]=s[i-1]+s[i-2];
for (i=1;i<=n;i++)
{
scanf("%d",&p);
printf("%d\n",s[p]);
}
return 0;
}
| 61 |
30,187 | int main()
{
int n, a, b, c, i, m;
cin >> n;
for (; n > 0; n--)
{
cin >> m;
a = 1, b = 1;
if (m <= 2)
{
cout << 1;
continue;
}
for (i = 3; i <= m; i++)
{
c = a + b;
a = b;
b = c;
}
cout << c << endl;
}
return 0;
}
| 61 |
30,188 | int f(int a)
{
if(a==1)
return 1;
if(a==2)
return 1;
else
return f(a-1)+f(a-2);
}
int main()
{
int n=0,m=0;
scanf("%d",&n);
for(int i=0;i<n;i++)
{
cin>>m;
printf("%d\n",f(m));
}
return 0;
} | 61 |
30,189 | int main()
{
int n,j,i,a[10000],b[20];
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d",&a[i]);
}
for(j=0;j<n;j++){
for(i=0;i<a[j];i++){
if(i==0||i==1){
b[i]=1;
}else{
b[i]=b[i-2]+b[i-1];
}
}
printf("%d\n",b[a[j]-1]);
}
return 0;
} | 61 |
30,190 | int fib(int n);
int main(){
int N;
cin>>N;
for(int i=0;i<N;i++){
int n;
cin>>n;
cout<<fib(n)<<endl;
}
return 0;
}
int fib(int n){
if(n==1||n==2) return 1;
else return (fib(n-1)+fib(n-2));
} | 61 |
30,191 | int main(){
int n,i,a,tuzhi[25];
scanf("%d",&n);
tuzhi[0]=1;
tuzhi[1]=1;
for(i=2;i<25;i++){
tuzhi[i]=tuzhi[i-1]+tuzhi[i-2];
}
for(i=0;i<n;i++){
scanf("%d",&a);
printf("%d\n",tuzhi[a-1]);
}
scanf("%d",&n);
return 0;
}
| 61 |
30,192 | int main()
{
int i,j,n;
int a[30]={1},b[20];
a[1]=a[0];
for(i=2;i<30;i++)
a[i]=a[i-2]+a[i-1];
scanf ("%d",&n);
for(j=0;j<n;j++)
scanf("%d",&b[j]);
for(j=0;j<n;j++)
printf("%d\n",a[b[j]-1]);
getchar(); getchar(); getchar();
}
| 61 |
30,193 | int main()
{
int n,f[20],a[20],i;
f[0]=1;
f[1]=1;
for(i=2;i<=19;i++)
f[i]=f[i-1]+f[i-2];
cin>>n;
for(i=0;i<=n-1;i++)
cin>>a[i];
for(i=0;i<=n-1;i++)
cout<<f[a[i]-1]<<endl;
return 0;
} | 61 |
30,194 | int f(int n)
{
if(n==1||n==2)
return 1;
else
return f(n-1)+f(n-2);
}
void main()
{
int n,i,shu[100];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&shu[i]);
printf("%d\n",f(shu[i]));
}
} | 61 |
30,195 | int f(int n)
{
if(n==1 || n==2)
return 1;
else
return f(n-1)+f(n-2);
}
int main()
{
int n,num,ans,i;
scanf("%d",&n);
for(i=1;i<n;i++)
{ scanf("%d",&num);
ans=f(num);
printf("%d\n",ans);
}
scanf("%d",&num);
ans=f(num);
printf("%d",ans);
} | 61 |
30,196 | /*
* Fibonacci.cpp
*
* Created on: 2012-10-22
* Author: ??
* ????????????????: ?????????????1????????????2?????
???????a???????????a??????
*/
int main()
{
int n = 0 ,a = 0, b = 1 , x1 =1, x2 =1, x3 = 1 ; //???????????
cin >> n ; //????
for ( int i = 0 ; i<n ; i++ )
{
cin >> a ; //??a
if ( a == 1 || a == 2 )
cout << "1" << endl ; //?????????????1
else
{
for ( int k = 1 ; k <= a-2 ; k++ )
{
x3 = x1 + x2 ;
x1 = x2 ;
x2 = x3 ; //??b??
}
b = x3 ; //?b??
cout << b << endl ; //??b??
x1 =1, x2 =1, x3 = 1 ; //????
}
}
return 0 ; //??
}
| 61 |
30,197 | int a[100];
int F(int n)
{ if(n==1||n==2)return 1;
else return F(n-1)+F(n-2);
}
int main()
{ int n;
cin>>n;
for(int i=0;i<n;i++)
{
cin>>a[i];
}
for(int j=0;j<n;j++)
{cout<<F(a[j])<<endl;
}
return 0;
}
| 61 |
30,198 | int main()
{
int n, i, order[21], total_number;
cin >> n;
for (i = 1; i <= n; i++)
{
cin >> order[i];
int Rabbit_Amount (int x);
total_number = Rabbit_Amount(order[i]);
cout << total_number << endl;
}
return 0;
}
int Rabbit_Amount (int x)
{
int f1, f2, f;
f1 = 1;
f2 = 1;
if ((x == 1) || (x == 2))
{
f = 1;
}
else
{
for (int j = 1; j <= x - 2; j++)
{
f = f1 + f2;
f1 = f2;
f2= f;
}
}
return f;
}
| 61 |
30,199 | int main()
{
int n,i,a[1000],b[100];
scanf("%d",&n);
a[1]=1;
a[2]=1;
for(i=1;i<=n;i++)
{
scanf("%d",&b[i]);
}
for(i=3;i<=1000;i++)
{
a[i]=a[i-1]+a[i-2];
}
for(i=1;i<=n;i++)
{
printf("%d\n",a[b[i]]);
}
getchar();
getchar();
getchar();
}
| 61 |
Subsets and Splits