id
int32 0
32.5k
| code
stringlengths 95
8.4k
| label
stringclasses 65
values |
|---|---|---|
30,200 |
int feibonaqi(int N);
int main()
{
int n;
int j;
int a[1000];
scanf("%d", &n);
for (j = 0; j < n; j++ )
{
scanf("%d", &a[j]);
}
for (j = 0; j <n; j++)
{
printf("%d\n", feibonaqi(a[j]));
}
return 0;
}
int feibonaqi(int N)
{ int F[1000];
int i;
F[0] = 1;
F[1] = 1;
for (i = 2; i < N; i++)
{
F[i] = F[i-1] + F[i-2];
}
return F[N-1];
}
| 61 |
30,201 | int f(int n)
{
if (n==1)
return 1;
else if (n==2)
return 1;
else if (n>2)
return(f(n-1)+f(n-2));
}
int main()
{
int m,a;
scanf("%d",&m);
while (m--)
{
scanf("%d",&a);
printf("%d\n",f(a));
}
}
| 61 |
30,202 | int main()
{
int m,i=1,p,a=1,b=1,c[20]={0},sum;
cin>>m;
for (p=0;p<=m-1;p++)
cin>>c[p];
p=0;
for (p=0;p<=m-1;p++)
{ a=1;b=1;
for (i=1;i<=c[p]-2;i++)
{
sum=a+b;a=b;b=sum;
}
cout<<b<<endl;
}
return 0;
}
| 61 |
30,203 | main()
{ int n,i,j,a;
int b[21];
b[1]=1; b[2]=1;
scanf("%d",&n);
for(j=3;j<=20;j++)
b[j]=b[j-1]+b[j-2];
for(i=1;i<=n;i++)
{ scanf("%d",&a);
if(i==1)
printf("%d",b[a]);
else
printf("\n%d",b[a]);
}
getchar();
getchar();
}
| 61 |
30,204 | int main(){
int n,a,sz[30],i,j,t,e;
i=1;
j=1;
sz[0]=1;
sz[1]=1;
for(t=2;t<30;t++){
sz[t]=i+j;
e=i;
i=i+j;
j=e;
}
scanf("%d",&n);
for(t=0;t<n;t++){
scanf("%d",&a);
printf("%d\n",sz[a-1]);
}
return 0;
} | 61 |
30,205 | void main()
{
int Fibonacci(int n);
int n, a[100], i;
scanf("%d\n", &n);
for(i=0; i<n; i++)
scanf("%d", &a[i]);
for(i=0; i<n; i++)
printf("%d\n", Fibonacci(a[i]));
}
int Fibonacci(int n)
{
int i, a[20];
a[0]=1;
a[1]=1;
for(i=2; i<n; i++)
a[i]=a[i-2]+a[i-1];
return (a[n-1]);
} | 61 |
30,206 | int main(){
int n,sum=0,a=1,b=1,d[20],c[20];
scanf("%d",&n);
for(int i=0;i<n;i++){
scanf("%d",&d[i]);
if(d[i]>2){
for(int j=1;j<d[i]-1;j++){
sum=a+b;
a=b;
b=sum;
}
}else{
b=1;
}
c[i]=b;
b=1;
a=1;
}
for(int k=0;k<n;k++){
printf("%d\n",c[k]);
}
return 0;
} | 61 |
30,207 |
int main()
{
int n=0;
cin >> n;
int a[n];
int i,j=0;
int f1,f2,p=0;
for(i=1;i<=n;i++)
{
cin >> a[i];
f1=1;
f2=1;
p=1;
if(a[i]==1||a[i]==2) cout <<"1" <<endl;
else
{
for(j=1;j<=a[i]-1;j++)
{
p=f1;
f1=f2;
f2=f2+p;
}
cout << f1 <<endl;
}
}
return 0;
} | 61 |
30,208 | int main(){
int n,i,j;
scanf("%d",&n);
int a[10000],b[10000];
for(i=0;i<n;i++){
scanf("%d",&a[i]);
}
for(i=0;i<n;i++){
for(j=0;j<a[i];j++){
if(j==0 || j==1){
b[j]=1;
}
else{
b[j]=b[j-1]+b[j-2];
}
}
if(i!=n-1)
printf("%d\n",b[j-1]);
else
printf("%d",b[j-1]);
}
return 0;
} | 61 |
30,209 | int main()
{
int f[25]={0,1,1},n,a[20],i,j;
for(i=3;i<=25;i++)
{
f[i]=f[i-1]+f[i-2];
}
scanf("%d",&n);
for(j=0;j<n;j++)
{
scanf("%d",&a[j]);
printf("%d\n",f[a[j]]);
}
return 0;
} | 61 |
30,210 |
int main(int argc, char* argv[])
{
int sz[100],i,n,a;
scanf("%d",&n);
sz[0]=1;
sz[1]=1;
for(i=2;i<100;i++){
sz[i]=sz[i-1]+sz[i-2];
}
for(i=0;i<n;i++){
scanf("%d",&a);
printf("%d\n",sz[a-1]);
}
return 0;
}
| 61 |
30,211 | int feibonaqi(int a)
{
int i,sz[21];
sz[0]=1;
sz[1]=1;
for(i=2;i<a;i++)
{
sz[i]=sz[i-1]+sz[i-2];
}
return sz[a-1];
}
int feibonaqi(int a);
int main()
{
int n,result[21],i,a;
scanf("%d", &n);
for(i=0;i<n;i++)
{
scanf("%d", &a);
result[i]=feibonaqi(a);
}
for(i=0;i<n;i++)
{
printf("%d\n", result[i]);
}
scanf(" ");
return 0;
} | 61 |
30,212 | int F(int n);
int main(){
int n;
int bb[20],sl[20];
scanf("%d",&n);
for(int i=0;i<n;i++){
scanf("%d",&bb[i]);
sl[i]=F(bb[i]);
printf("%d\n",sl[i]);
}
return 0;
}
int F(int n){
int result;
int sz[10000];
sz[0]=1,sz[1]=1;
for(int r=2;r<10000;r++){
sz[r]=sz[r-1]+sz[r-2];
}
for(int y=0;y<10000;y++){
if(n==y+1){
result=sz[y];
break;
}
}
return result;
}
| 61 |
30,213 |
int main()
{
int n, t;
cin >> n;
int i;
while (n--)
{
int a = 1, b = 1, c;
cin >> t;
for (i = 0;i < t-1;i++)
{
c = a + b;
a = b;
b = c;
}
cout << a << endl;
}
return 0;
} | 61 |
30,214 | main()
{
int n,i;
scanf("%d",&n);
for(i=1;i<=n;i++)
{
int m,j;
scanf("%d",&m);
int a[1000];
a[1]=1;
a[2]=1;
for(j=3;j<=m;j++)
a[j]=a[j-1]+a[j-2];
if(m==1||m==2)
printf("%d",1);
else
printf("%d",a[m]);
if(i<n)
printf("\n");
}
getchar();
} | 61 |
30,215 | int main ()
{
int i,n,j,a[20],s[20];
int f[20];
scanf("%d",&n);
for(j=0;j<n;j++)
{
scanf("%d",&a[j]);
}
for(i=3;i<=20;i++)
{
f[1]=1;
f[2]=1;
f[i]=f[i-2]+f[i-1];
}
for(i=1;i<=20;i++)
for(j=0;j<n;j++)
if(a[j]==i)
{
s[j]=f[i];
}
for(j=0;j<n;j++)
printf("%d\n",s[j]);
getchar ();
getchar ();
return 0;
}
| 61 |
30,216 | int main()
{
int a1,a2,a3,i,j,p,n,t;
cin>>n;
for (i=0;i<n;i++)
{
a1=1;
a2=1;
cin>>p;
if(p==1||p==2) cout<<"1"<<endl;
else
{
for(j=2;j<p;j++)
{
a3=a1+a2;
t=a3;
a1=a2;
a2=t;
}
cout<<a3<<endl;
}
}
return 0;
}
| 61 |
30,217 | int main()
{
int n,a[100],t[100],i,j,c=1,b=1,e,l;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
for(i=0;i<n;i++)
{
if(a[i]==2||a[i]==1)
{
printf("1\n");
}
else
{
c=1;b=1;
for(j=2;j<a[i];j++)
{
t[j]=c+b;
l=j;
e=b;
b=c+b;
c=e;
}
printf("%d\n",t[l]);
}
}
return 0;
}
| 61 |
30,218 | int main()
{
int k,s,g;
int a[20];
a[1]=1;
a[2]=1;
for(int j=3;j<=20;j=j+1)
{
a[j]=a[j-1]+a[j-2];
}
cin>>k;
for(int i=0;i<k;i++)
{
cin>> g;
s=a[g];
cout<<s<<endl;
}
} | 61 |
30,219 | int main()
{
int k,i,j,a,m=1,n=1,temp;
scanf("%d",&k);
int * sum= (int *)malloc(sizeof(int)*k);
for(i=0;i<k;i++)
{
scanf("%d",&a);
if(a==1||a==2)
sum[i]=1;
else
{
m=1;n=1;
sum[i]=0;
for(j=1;j<=a-2;j++)
{
sum[i]=m+n;
m=n;
n=sum[i];
}
}
}
for(i=0;i<k;i++)
printf("%d\n",sum[i]);
return 0;
}
| 61 |
30,220 | int f(int n)
{
if(n==1) return 1;
else if(n==2) return 1;
else return f(n-1)+f(n-2);
}
main()
{int n,a[10000];
scanf("%d",&n);
int i;
for(i=0;i<n;i++)
{scanf("%d",&a[i]);
printf ("%d\n",f(a[i]));
}
getchar();
}
| 61 |
30,221 | int main()
{
int n,i;
scanf("%d",&n);
int a[n];
for(i=0; i<=n-1;i++)
{
scanf("\n%d",&a[i]);
}
int A[20];
A[0]=1;
A[1]=1;
for(i=2;i<=19;i++)
{
A[i]=A[i-1]+A[i-2];
}
for(i=0;i<=n-1;i++)
{
a[i]=A[a[i]-1];
}
printf("%d",a[0]);
for(i=1;i<=n-1;i++)
{
printf("\n%d",a[i]);
}
}
| 61 |
30,222 | int main()
{
int n,i,j,k,s,a,b;
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%d",&k);
if(k==1||k==2)
{
printf("1\n");
continue;
}
else
{
a=1;
b=1;
for(j=3;j<=k;j++)
{
s=a+b;
a=b;
b=s;
}
printf("%d\n",s);
}
}
getchar();
getchar();
} | 61 |
30,223 |
int n;
int f[20];
void fb(int i)
{
if(i == 0 ||i ==1)
f[i] = 1;
else
f[i] = f[i - 1] + f[i - 2];
}
int main()
{
cin >> n;
for(int i = 0;i < 20;i++)
fb(i);
while(n > 0)
{
int m = 0;
cin >> m;
cout << f[m - 1] << endl;
n--;
}
} | 61 |
30,224 | int main()
{int a[20]={1,1},i,n,c,b;
for(i=2;i<=20;i++)a[i]=a[i-1]+a[i-2];
cin>>n;
for(i=1;i<=n;i++){cin>>c;cout<<a[c-1]<<'\n';}
return 0;
} | 61 |
30,225 | /*
* febonacci.cpp
*?? - ??????
??
?????????????: ?????????????1????????????2?????
???????a???????????a??????
????
?1?????????n?????n???????????1?????????a(1 <= a <= 20)
????
n????????????????????????????????a?????
????
4
5
2
19
1
????
5
1
4181
1
* Created on: 2013-9-27
* Author: ???
*/
int main()
{
int x[20]={1,1};//feibonacci??
for(int i=2;i<20;i++)
x[i]=x[i-1]+x[i-2];
int n=0;
cin >> n;
int a[n];
for(int i=0;i<n;i++)
cin >> a[i];
for(int i=0;i<n;i++)
cout << x[a[i]-1] << endl;
return 0;
}
| 61 |
30,226 |
int main() {
int n=0;
int a[21];
cin>>n;
for (int i=0;i<n;i++){
cin>>a[i];
if (a[i]==1) //?????1
cout<<1<<endl;
if (a[i]==2) //?????1
cout<<1<<endl;
if (a[i]>=3){ //??????????
int a1=1,a2=1,a3=0;
for (int j=3;j<=a[i];j++){
a3=a1+a2;
a1=a2;
a2=a3;} //????????2?????
cout<<a3<<endl;}
}
return 0;
}
| 61 |
30,227 | int a[201];
void ni(int m)
{
if(m==202)
return;
a[m]=a[m-1]+a[m-2];
ni(m+1);
}
int main()
{
a[0]=1;
a[1]=1;
ni(2);
int n,i,k;
cin>>n;
for(i=1;i<=n;i++)
{
cin>>k;
cout<<a[k-1]<<endl;
}
return 0;
} | 61 |
30,228 | int main()
{
int a[101],i,j,k;
a[1]=1;
a[2]=1;
for(i=3;i<=100;i++)
{
a[i]=a[i-1]+a[i-2];
}
int n;
cin>>n;
for(j=1;j<=n;j++)
{
cin>>k;
cout<<a[k]<<endl;
}
return 0;
} | 61 |
30,229 | int main ()
{
int n,k,x;
cin>>n;
int a[n];
int sum[n];
for(k=0;k<n;k=k+1)
{
cin>>a[k];
int b[a[k]];
b[0]=1;
b[1]=1;
for(x=2;x<a[k];x=x+1)
{
b[x]=b[x-1]+b[x-2];
}
sum[k]=b[a[k]-1];
}
for(k=0;k<n;k=k+1)
cout<<sum[k]<<endl;
return 0;
} | 61 |
30,230 | int main()
{
int n,a[100],s[100],i,j;
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%d\n",&a[i]);
s[1]=1;
s[2]=1;
for(j=3;j<=a[i];j++)
{
s[j]=s[j-1]+s[j-2];
}
s[i]=s[a[i]];
printf("%d\n",s[i]);
}
return 0;
}
| 61 |
30,231 | //??????
int fun(int n);
int main()
{
int n = 0, i = 0, x = 0;
cin >> n;
for (i = 1; i <= n; i++)
{
cin >> x;
cout << fun(x) << endl;
}
return 0;
}
int fun(int n)
{
if (n == 1 || n == 2)
return 1;
else
return fun(n - 1) + fun(n - 2);
}
| 61 |
30,232 | int f(int a)
{
if(a==1||a==2)
return 1;
else
return (f(a-1)+f(a-2));
}
int main()
{
int n,i;
scanf("%d",&n);
int a[n];
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
printf("%d\n",f(a[i]));
}
getchar();
getchar();
} | 61 |
30,233 | int main(){
int a=1 ,b=1,n,e,sz[10000]={1,1},j,i;
scanf("%d",&n);
for(j=0;j<n;j++){
scanf("%d",&e);
for(i=2;i<e;i++){
sz[i]=sz[i-1]+sz[i-2];
}
printf("%d\n",sz[e-1]);
}
return 0;
} | 61 |
30,234 |
int main()
{
int a[10000];
a[0]=1;a[1]=1;
int n;
scanf("%d",&n);
for(int j=0;j<n;j++)
{
int k;
scanf("%d",&k);
for(int i=2;i<k;i++)
a[i]=a[i-1]+a[i-2];
printf("%d\n",a[k-1]);
}
getchar();
getchar();
getchar();
}
| 61 |
30,235 | int f(int a)
{
if(a==1||a==2) return 1;
return f(a-1)+f(a-2);
}
main()
{
int n;
scanf("%d",&n);
printf("\n");
int i;
for(i=0;i<n;i++)
{
int a;
scanf("%d",&a);
printf("%d\n",f(a));
printf("\n");
}
}
| 61 |
30,236 |
int F(int x)
{
if (x == 2 || x == 1)
return 1;
return F(x - 1) + F(x - 2);
}
int main()
{
int a, n;
cin >> n;
for(; n > 0; n--)
{
cin >> a;
cout << F(a) << endl;
}
} | 61 |
30,237 | int fibbnacci(int x)
{
int a,b,c;
a=b=1;
if(x==1 || x==2) return a;
for(int i=3;i<=x;i++)
{c=b;b=a+b;a=c;
}
return b;
}
int main()
{
int a[15];
int n;cin>>n;
for(int i=0;i<n;i++)
{cin>>a[i];}
for(int j=0;j<n;j++)
{
cout<<fibbnacci(a[j])<<endl;}
return 0;
}
| 61 |
30,238 | int main()
{
int n,i,a[100]={0};
unsigned long f[25]={0};
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
f[0]=1;
f[1]=1;
for(i=2;i<20;i++)
{
f[i]=f[i-1]+f[i-2];
}
for(i=0;i<n;i++)
{
printf("%d\n",f[a[i]-1]);
}
return 0;
}
| 61 |
30,239 | int main()
{
int n,i,c,d,e;
cin >>n;
const int N=n;
int a[N];
for(i=0;i<=N-1;i=i+1){
cin>>a[i];
}
for(i=0;i<=N-1;i=i+1){
for(e=1,c=1,d=1;e<=a[i]-2;e=e+2){
c=c+d;
d=c+d;
}
if(a[i]%2==1){
cout<<c<<'\n'<<endl;
}
else {
cout<<d<<'\n'<<endl;
}
}
return 0;
} | 61 |
30,240 | int main()
{
int a[21],i,n;
a[0]=1;
a[1]=1;
cin>>n;
for(i=1;i<20;i++)
{
a[i+1]=a[i]+a[i-1];
}
while(cin>>i)
{
cout<<a[i-1]<<endl;
}
return 0;
} | 61 |
30,241 |
int main(int argc, char *argv[])
{
int n;
scanf("%d",&n);
int shulie[20];
int i;
shulie[0]=1;
shulie[1]=1;
for(i=2;i<=19;i++){
shulie[i]=shulie[i-1]+shulie[i-2];
}
int ceshi[n];
for(i=0;i<n;i++){
scanf("%d",&ceshi[i]);
}
for(i=0;i<n;i++){
printf("%d\n",shulie[ceshi[i]-1]);
}
return 0;
} | 61 |
30,242 |
int cmp(const void * p1, const void * p2)
{
return 0;
}
int a[25];
int main()
{
int n;
cin >> n;
a[0] = a[1] = 1;
for (int i = 2; i < 21; i ++)
a[i] = a[i - 1] + a[i - 2];
int b;
while (n --)
{
cin >> b;
cout << a[b - 1] << endl;
}
return 0;
} | 61 |
30,243 | int f(int n)
{
int c;
if (n==1||n==2)
c=1;
else c=f(n-1)+f(n-2);
return (c);
}
void main()
{
int i,m,n,*p;
p=(int *)malloc(20*sizeof(int));
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",p+i);
for(i=0;i<n;i++)
{m=f(*(p+i));
printf("%d\n",m);
}
} | 61 |
30,244 | int main()
{
int n,i,j,m,a[100]={0};
a[1]=a[2]=1;
scanf("%d",&n);
for(j=0;j<n;j++)
{
scanf("%d",&m);
if(m==1||m==2)printf("1\n");
else
{
for(i=3;i<=m;i++)
{
a[i]=a[i-1]+a[i-2];
}
printf("%d\n",a[m]);
}
}
}
| 61 |
30,245 | int num(int a)
{
int m;
if (a==1||a==2)
m=1;
else
m=num(a-1)+num(a-2);
return (m);
}
int main()
{
int i,n,m;
int a[100];
scanf("%d",&n);
for (i=0;i<n;i++)
scanf("%d",&a[i]);
for (i=0;i<n;i++)
{
m=num(a[i]);
printf("%d\n",m);
}
return 0;
} | 61 |
30,246 | int main()
{
int *n,x,i,*ans;
int fibonacci(int);
scanf("%d",&x);
n=(int *)calloc(x,sizeof(int));
ans=(int *)calloc(x,sizeof(int));
for(i=0;i<x;i++)
{
scanf("%d",&n[i]);
}
for(i=0;i<x;i++)
{
ans[i]=fibonacci(n[i]);
printf("%d\n",ans[i]);
}
}
int fibonacci(int n)
{
if(n==1 || n==2) return 1;
else return fibonacci(n-2)+fibonacci(n-1);
} | 61 |
30,247 | int main(){
int n,i,m,j,d;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&m);
if( m == 1 || m == 2 )
{
printf("%d\n",1);
continue;
}
int a = 1;
int b = 1;
for( j = 3; j <= m; j++ )
{
d = a + b;
a = b;
b = d;
}
printf("%d\n", d );
}
return 0;
} | 61 |
30,248 | int main()
{
int n;
scanf("%d",&n);
for(int z=0;z<n;z++)
{
int m;
scanf("%d",&m);
if(m==1||m==2)
{printf("1\n");break;}
int a=1,b=1,d,c;
for(int i=2;i<m;i++)
{
c=a+b;
d=b;
b=c;
a=d;
}
printf("%d\n",b);
}
} | 61 |
30,249 | int main()
{
int a,b,c,i,k,n,m;
a=1;
b=1;
scanf("%d\n",&n);
int u[n];
for(i=1;i<=n;i++)
{scanf("%d\n",&m);
if(m<=2) c=1;
else a=1;b=1; for(k=3;k<=m;k++)
{
c=a+b;
a=b;
b=c;
}
u[i]=c;
}
for(i=1;i<=n;i++)
printf("%d\n",u[i]);
return 0;
}
| 61 |
30,250 | int main()
{
int n,a[20],i,m;
scanf("%d",&n);
a[0]=1;
a[1]=1;
for(i=2;i<20;i++)
{
a[i]=a[i-1]+a[i-2];
}
for(i=0;i<n;i++)
{
scanf("%d",&m);
printf("%d\n",a[m-1]);
}
getchar();
getchar();
}
| 61 |
30,251 | int main(){
int f1,f2,f3,n,a,i,b;
cin>>n;
for (i=1;i<=n;i=i+1)
{
cin>>a;
f1=1;
f2=1;
for(b=1;b<=(a-1);b++)
{
f3=f1+f2;
f1=f2;
f2=f3;
}
cout<< f1 << endl;}
return 0;
}
| 61 |
30,252 | //??
//?????????????: ?????????????1????????????2?????
//???????a???????????a??????
//????
//?1?????????n?????n???????????1?????????a(1 <= a <= 20)
//????
//n????????????????????????????????a?????
int main()
{
int f(int x);
int n;
cin>>n;
int a[50];
for(int i=1;i<=n;i++)
{
cin>>a[i];
int z;
z=f(a[i]);
cout<<z<<endl;
}
return 0;
}
int f(int x)
{
int count=2,sum1=1,sum2=1;
if(x==1||x==2) sum2=1;
else{
do{
int temp;
temp=sum2;
sum2=sum1+sum2;
sum1=temp;
count++;
}while(count<x);
}
return sum2;
}
| 61 |
30,253 | int main()
{
int feb(int x);
int n,i,j,a[1000],f;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&a[i]);
for(j=0;j<n;j++)
{
f=feb(a[j]);
printf("%d\n",f);
}
getchar();
getchar();
}
int feb(int x)
{
int i;
int a[x+1];
a[1]=1;
a[2]=1;
for(i=3;i<=x;i++)
a[i]=a[i-1]+a[i-2];
return(a[x]);
} | 61 |
30,254 | int main()
{
int z[1001];
int a,n;
z[1]=1;
z[2]=1;
scanf("%d",&n);
for(a=1;a<=998;a++)
{
z[a+2]=z[a+1]+z[a];
}
for(a=1;a<=n;a++)
{
scanf("%d",&z[0]);
printf("%d\n",z[z[0]]);
}
return 0;
}
| 61 |
30,255 | int main()
{
int f(int a);
int i,n,c;
cin>>n;
for(i=1;i<=n;i++)
{cin>>c;
cout<<f(c)<<endl;}
return 0;
}
int f(int a)
{
int b;
if(a<0) {cout<<"error";b=-1;}
else if (a==1||a==2) b=1;
else b=f(a-1)+f(a-2);
return b;
}
| 61 |
30,256 | int fib(int n)
{
if (n == 1)
return 1;
if (n == 2)
return 1;
return fib(n - 1) + fib(n - 2);
}
int main()
{
int n, k;
cin >> n;
while (n--)
{
cin >> k;
cout << fib(k) << endl;
}
return 0;
} | 61 |
30,257 |
int a[10000];
int f(int n)
{
if(n == 1 || n == 2)
return 1;
a[n] = f(n - 1) + f(n - 2);
return a[n];
}
int main()
{
a[1] = a[2] = 1;
int n, i, maxnumber = 0;
cin >> n;
int b[20];
for( i = 0; i < n; i++)
{
cin >> b[i];
if(b[i] > maxnumber)
maxnumber = b[i];
}
int x = f(maxnumber);
for(i = 0; i < n; i++)
cout << a[b[i]] << endl;
return 0;
} | 61 |
30,258 |
int main()//???
{
int i,n;
cin >> n;
for ( i = 0; i < n ; i++ )
{
int a,p = 1,q = 1,o,j;
cin >> a;
for ( j = 1; j <= a; j++)//??a?????
{
if ( j == 1 || j == 2 )
p = 1;
else
{
o = p;
p = p + q;//?a?????
q = o;//?a-1?????
}
}
cout << p <<endl;
}
return 0;
} | 61 |
30,259 | int main()
{
int n=0,a=0,i=0,j=0;
int f[30];
for(i=0;i<30;i++)
f[i]=0;
cin>>n;
for(i=1;i<=n;i++)
{
f[1]=1;
f[2]=1;
cin>>a;
if(a==1||a==2)
cout<<1<<endl;
else
{
for(j=3;j<=a;j++)
f[j]=f[j-1]+f[j-2];
cout<<f[a]<<endl;
}
}
return 0;
} | 61 |
30,260 | int main()
{
int res[10000]={0,1},i,n,a,j,b[10000]={0};
scanf("%d",&n);
for(i=1;i<=n;i++){
scanf("%d",&a);
for(j=2;j<=a;j++){
res[j]=res[j-1]+res[j-2];
}
b[i]=res[a];
}
for(i=1;i<=n;i++){
printf("%d\n",b[i]);
}
return 0;
}
| 61 |
30,261 | int main()
{
int f[20] = {1, 1}, k, a, i, n;
cin >> n;
for (i = 1; i <= n; i++)
{
cin >> a;
for (k = 2; k < a; k++)
{
f[k] = f[k - 2] + f[k - 1];
}
cout << f[k-1] << endl;
}
return 0;
} | 61 |
30,262 | int main()
{
int a[21];
a[1]=1;
a[2]=1;
a[3]=2;
a[4]=3;
a[5]=5;
a[6]=8;
a[7]=13;
a[8]=21;
a[9]=34;
a[10]=55;
a[11]=89;
a[12]=144;
a[13]=233;
a[14]=377;
a[15]=610;
a[16]=987;
a[17]=1597;
a[18]=2584;
a[19]=4181;
a[20]=6765;
int n,j,i;
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%d",&j);
printf("%d\n",a[j]);
}
return 0;
}
| 61 |
30,263 |
int f(int);
int main()
{
int n, i, a[21];
cin >> n;
for (i = 0; i < n; i++)
{
cin >> a[i];
cout << f(a[i]) << endl;
}
return 0;
}
int f(int ah)
{
if (ah == 1 || ah == 2)
return 1;
return f(ah - 1) + f(ah - 2);
} | 61 |
30,264 | /*????????????????: ?????????????1????????????2?????
* ???????a???????????a??????
* n?????????????
*????: 2012-10-4
*??: ??
*/
int main()
{
int n, i, j, a;
cin >> n; //n???
for(i = 1; i <= n; i++)
{cin >> a;
int fibo[a+1]; //????????
fibo[0] = 0; //fibo[0]???0??fibo[a]????
fibo[1] = 1;
for(j = 2; j <= a; j++)
fibo[j] = fibo[j-1] + fibo[j-2]; //???fibo[a]
cout << fibo[a] << endl;
}
return 0;
}
| 61 |
30,265 | /*
*100022.cpp
*????????????a?????
*Created on: 2012-10-13
*Author:??
*/
int shuchu[20];//????
int shuru[100];
int n=0,i=0,k=0;
int main(){
cin>>n;
for(k=0;k<n;k++){//????
cin>>shuru[k];
cout<<endl;
}
shuchu[0]=1;
shuchu[1]=1;
for(i=2;i<20;i++){//????
shuchu[i]=shuchu[i-1]+shuchu[i-2];
}
for(k=0;k<n;k++){
cout<<shuchu[shuru[k]-1]<<endl;
}
return 0;
}
| 61 |
30,266 | int shulie(int n);
int main()
{
int n,i,j,weizhi[100],jl[500]={0};
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&weizhi[i]);
}
for(i=0;i<n;i++)
{
jl[i]=shulie(weizhi[i]);
}
for(i=0;i<n;i++)
{
printf("%d\n",jl[i]);
}
return 0;
}
int shulie(int n)
{
int i,shulie[500]={1,1};
for(i=2;i<n;i++)
{
shulie[i]=shulie[i-1]+shulie[i-2];
}
return shulie[i-1];
} | 61 |
30,267 | int main()
{
int *a;
int n,i;
int x(int c);
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",x(*(a+i)));
}
return 0;
}
int x(int c)
{
int r;
if(c==1)
return 1;
else if(c==2)
return 1;
else
{
r=x(c-1)+x(c-2);
return r;
}
} | 61 |
30,268 | int main()
{
int n,i,j,a[20],b[20];
a[0]=a[1]=1;
for(i=2;i<20;i++)
a[i]=a[i-1]+a[i-2];
scanf("%d",&n);
for (i=0;i<n;i++)
{
scanf("%d",&b[i]);
}
for (i=0;i<n;i++)
{
for (j=1;j<21;j++)
{
if(b[i]==j)
printf("%d\n",a[j-1]);
}
}
return 0;
} | 61 |
30,269 | main()
{
int n,i,j,m;
int a[999];
for(i=0;i<999;i++)
a[i]=0;
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%d",&m);
a[0]=1;a[1]=1;
for(j=2;j<m;j++)
a[j]=a[j-2]+a[j-1];
printf("%d\n",a[m-1]);
}
} | 61 |
30,270 | int fb(int x);
int main(){
int n,i,b;
int a[20];
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d",&a[i]);
}
for(i=0;i<n;i++){
b=fb(a[i]);
printf("%d\n",b);
}
return 0;
}
int fb(int x){
int y=1,z=1,c,i;
if(x==1||x==2){
c=1;
}
else{
for(i=2;i<x;i++){
c=y+z;
y=z;
z=c;
}
}
return c;
} | 61 |
30,271 | int main(){
int n,i,k,j;
scanf("%d",&n);
int a[n],c[n];
for(i=0;i<n;i++){
scanf("%d",&a[i]);
}
int b[21];
b[0]=0;
b[1]=b[2]=1;
for(i=3;i<21;i++){
b[i]=b[i-1]+b[i-2];
}
for(i=0;i<n;i++){
k=a[i];
c[i]=b[k];
}
for(i=0;i<n;i++){
printf("%d\n",c[i]);
}
scanf("%d",&k);
return 0;
}
| 61 |
30,272 | int f(int x){
int i,sz[1000];
for(i=0;i<x;i++){
if(i==0){sz[i]=1;}
if(i==1){sz[i]=1;}
if(i>1){
sz[i]=sz[i-1]+sz[i-2];
}
}
return sz[x-1];
}
int main(){
int n,y,m[1000],h[1000];
scanf("%d",&n);
for(y=0;y<n;y++){
scanf("%d",&m[y]);
h[y]=f(m[y]);
}for(y=0;y<n;y++){
printf("%d\n",h[y]);
}
return 0;
} | 61 |
30,273 | void main()
{
int t,i,j;
int a[10][21];
scanf("%d\n",&t);
for(i=0;i<t;i++)
scanf("%d\n",*(a+i));
for(i=0;i<t;i++)
{
*(*(a+i)+2)=1;
*(*(a+i)+1)=1;
for(j=3;j<=**(a+i);j++)
*(*(a+i)+j)=*(*(a+i)+j-1)+*(*(a+i)+j-2);
printf("%d\n",*(*(a+i)+--j));
}
}
| 61 |
30,274 | //
// main.cpp
// ??????
//
// Created by Hsu Tzuyen on 12-11-17.
// Copyright (c) 2012? Hsu Tzuyen. All rights reserved.
//
int f(int n)
{
int a[21];
a[1]=1;
a[2]=1;
for (int i = 3; i <=n; i++)
a[i] = a[i-1] + a[i-2];
return a[n];
}
int main()
{
int n, a;
cin >> n;
for (int i = 0; i < n; i++)
{
cin >> a;
cout << f(a) << endl;
}
return 0;
} | 61 |
30,275 |
int a[21];
void cal()
{
a[0]=1;
a[1]=1;
for(int i=2;i<=20;i++)
a[i]=a[i-1]+a[i-2];
}
int main()
{
int t;
scanf("%d",&t);
cal();
while(t--)
{
int n;
scanf("%d",&n);
printf("%d\n",a[n-1]);
}
return 0;
}
| 61 |
30,276 |
int main()
{
int n = 0;
int a = 0;
int i = 0;
int tmp1 = 1;
int tmp2 = 1;
int tmp;
scanf("%d", &n);
while (n--) {
scanf("%d", &a);
if (a <= 2) {
printf("1\n");
}
else {
for (i = 2; i < a; i++) {
tmp = tmp2;
tmp2 = tmp1 + tmp2;
tmp1 = tmp;
}
printf("%d\n", tmp2);
}
tmp1 = 1;
tmp2 = 1;
}
return 0;
} | 61 |
30,277 | int main(){
int n;
scanf("%d",&n);
int sz[1000];
int a;
for(int i=0;i<n;i++){
scanf("%d",&a);
for(int j=0;j<a;j++){
if(j==0||j==1){
sz[j]=1;
}
else{
sz[j]=sz[j-1]+sz[j-2];
}
}
printf("%d\n",sz[a-1]);
}
return 0;
}
| 61 |
30,278 | int F(int n);
int main(){int a[100];
int n, result,i;
scanf("%d", &n);
for(i=0;i<n;i++){
scanf("%d",&a[i]);}
for(i=0;i<n-1;i++){
printf("%d\n",F(a[i]));}
printf("%d",F(a[n-1]));
return 0;
}
int F(int n){
if(n==0)
return 0;
if(n==1)
return 1;
return F(n-1)+F(n-2);
}
| 61 |
30,279 | int f(int n);
int main(){
int a0,a1,i,n,l,sz[100];
scanf("%d",&l);
for(i=0;i<l;i++){
scanf("%d",&n);
// printf("%d",f(n));
sz[i]=f(n);
}
for(i=0;i<l;i++){
printf("%d\n",sz[i]);
}
return 0;
}
int f(int n){
int a0,a1,a2,i,r;
a0=1;
a1=1;
r=0;
if(n==1){
return 1;
}
else if(n==2){
return 1;
}
else if(n>2){
for(i=0;i<n-2;i++){
a2=a0+a1;
r=a2;
a0=a1;
a1=a2;
}
}
return r;
}
//1,1,2,3,5,8 | 61 |
30,280 | //??????
int main()
{
int i=0;
int a[10000];
a[0]=1;
a[1]=1;
for(i=2;i<10000;i++)
{
a[i]=0;
}
for(i=2;i<10000;i++)
{
a[i]=a[i-1]+a[i-2];
}
int n=0;
cin>>n;
int b[10000]; //?????????????????
for(i=0;i<10000;i++)
{
b[i]=0;
}
for(i=0;i<n;i++)
{
cin>>b[i];
}
for(i=0;i<n;i++)
{
cout<<a[b[i]-1]<<endl;
}
return 0;
}
| 61 |
30,281 | main()
{
int b[20]={1,1},m,n,i;
for(i=2;i<20;i++)
b[i]=b[i-1]+b[i-2];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&m);
printf("%d\n",b[m-1]);
}
getchar();
getchar();
}
| 61 |
30,282 | int add(int a1,int b1);
int main()
{
int q,p,n,result,i,a,k,sz[1000];
scanf("%d",&n);
for(k=0;k<n;k++)
{
scanf("%d",&a);
p=1;
q=1;
for(i=2;i<a;i++)
{
result=add(p,q);
p=q;
q=result;
}
if(a==2||a==1)
{
sz[k]=1;
}
else
{
sz[k]=result;
}
}
for(k=0;k<n;k++)
{
printf("%d\n",sz[k]);
}
return 0;
}
int add(int a1,int b1){
int s;
s=a1+b1;
return s;
}
| 61 |
30,283 |
int fib(int i)
{
int a = 0, b = 1;
while (--i) {
a = a + b;
swap(a, b);
}
return b;
}
int main()
{
int n;
cin >> n;
while (n--) {
int i;
cin >> i;
cout << fib(i) << endl;
}
return 0;
} | 61 |
30,284 | main()
{
int f[20];
int n,i,j,a;
f[0]=1;f[1]=1;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a);
if(a==1||a==2)
printf("1");
else
{
for(j=0;j+2<a;j++)
f[j+2]=f[j]+f[j+1];
printf("%d\n",f[a-1]);
}
}
getchar();
getchar();
} | 61 |
30,285 | int main()
{
int k,n,i,last1,last2,b,result;
scanf("%d",&k);
for(i=0;i<k;i++)
{
scanf("%d",&n);
if(n==1||n==2)
{
printf("1\n");
}
else
{
last1=1;
last2=1;
for(b=3;b<=n;b++)
{
result=last1+last2;
last2=last1;
last1=result;
}
printf("%d\n",result);
}
}
return 0;
} | 61 |
30,286 | /*
* fib.cpp
*
* Created on: 2012-10-21
* Author: Administrator
*/
int fib(int i){ //?????????????
if (i==1||i==2) return 1;
else return (fib(i-1))+fib((i-2));
} //???????????????????
int main (){
int n,i,a[20]; //??????????
cin>>n;
for (i=0;i<n;i++)
cin>>a[i];
for (i=0;i<n;i++)
cout<<fib(a[i])<<endl; //???????
return 0;
} | 61 |
30,287 | int main(){
int n,a[1000],b[1000],p,q,i,k,j;
scanf("%d",&n);
'\n';
for(i=0;i<n;i++){
scanf("%d\n",&a[i]);
}
for(i=0;i<n;i++){
p=1;
q=1;
for(k=2;k<a[i];k++){
j=p+q;
p=q;
q=j;
}
b[i]=q;
}
for(i=0;i<n-1;i++){
printf("%d\n",b[i]);
}
printf("%d",b[n-1]);
return 0;
}
| 61 |
30,288 |
int main() {
int n;
cin >>n;
const int x=n;
int a[x];
for (int i=0;i<=x-1;i=i+1)
cin >>a[i];
int max=0;
for (int ii=0;ii<=x-1;ii++)
{
if (a[ii]>max)
max=a[ii];
}
int b[max];
b[0]=1;
b[1]=1;
for (int j=2;j<=max-1;j=j+1)
b[j]=b[j-1]+b[j-2];
for (int k=0;k<=x-1;k=k+1)
{
int t=a[k]-1;
cout <<b[t]<<endl;
}
return 0;
}
| 61 |
30,289 |
int main() {
int m,x,a=1,b=1,k1,k2,n;//m??????? a?an-1 b?an-2 x?an k??? n??n??
cin >>m;
for (k1=1;k1<=m;k1=++k1)
{ cin >>n;
a=1;b=1;
if(n==1) cout<<1<<endl;
if(n==2) cout<<1<<endl;
if(n>=3)
{for (k2=3;k2<=n;++k2)
{x=a+b;
b=a;
a=x;}
cout <<x<<endl;}}
return 0;
} | 61 |
30,290 | int main()
{
int a[10],n,c=0,b=1,f=1;
int i,d,e,p;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
for(i=0;i<n;i++)
{
if(a[i]==1||a[i]==2)
printf("1");
else
{
for(p=2;p<a[i];p++)
{
c=f+b;
e=c;
d=b;
b=e;
f=d;
}
printf("\n%d\n",c);
c=0;
b=1;
f=1;
}
}
return 0;
} | 61 |
30,291 |
int fib(int a)
{
if (a == 1 || a == 2)
{
return 1;
}
return fib(a - 1) + fib(a - 2);
}
int main()
{
int a, i, n;
cin >> n;
for (i = 0; i < n; i++)
{
cin >> a;
cout << fib(a) << endl;
}
cout << endl;
return 0;
}
| 61 |
30,292 | /*
* find.cpp
*
* Created on: 2012-10-7
* Author: Administrator
*/
int fob(int j){ //??????j????????
if (j==1 || j==2) return 1; //????????
else {
int a=1,b=1,c;
for (int k=3;k<=j;k++){c=a+b;a=b;b=c;}
return c;
}
}
int main(){
int n,i;
cin>>n; //?????n,??????????
int a[n];
for (i=1;i<=n;i++){cin>>a[i];} //???a[0]
for (i=1;i<=n;i++){cout<<fob(a[i])<<endl;}
return 0;
}
| 61 |
30,293 | int fabo(int k);
int main()
{
int n,k;
cin>>n;
while(n>0)
{
cin>>k;
cout<<fabo(k)<<endl;
n--;
}
return 0;
}
int fabo(int k)
{
if(k==1)
return 1;
if(k==2)
return 1;
else
return fabo(k-1)+fabo(k-2);
}
| 61 |
30,294 | int f(int a)
{
if(a==1||a==2)
return 1;
else
return (f(a-1)+f(a-2));
}
int main()
{
int a[100];
int n,i,j;
cin>>n;
if(n<=100)
{
for(i=0;i<n;i++)
cin>>a[i];
for(i=0;i<n;i++)
if(a[i]>=1&&a[i]<=20)
cout<<f(a[i])<<endl;
}
return 0;
} | 61 |
30,295 | int Fibonacci(int n);
int main(){
int n,i,j,sz[20];
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d",&j);
sz[i]=Fibonacci(j);
printf("%d\n",sz[i]);
}
return 0;
}
int Fibonacci(int n){
int s1,s2,s3,i;
if(n==1){
return 1;
}
if(n==2){
return 1;
}
s1=1;
s2=1;
for(i=0;i<n-2;i++){
s3=s2+s1;
s1=s2;
s2=s3;
}
return s3;
} | 61 |
30,296 | int main()
{
int n,i;
int a[30],k[100];
scanf("%d",&n);
a[0]=1;
a[1]=1;
for(i=2;i<20;i++){
a[i]=a[i-1]+a[i-2];
}
for(i=0;i<n;i++){
scanf("%d",&k[i]);
}
for(i=0;i<n;i++){
printf("%d\n",a[k[i]-1]);
}
return 0;
} | 61 |
30,297 | 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){
if(a==1||a==2){
return 1;
}
int b,c,d,k;
c=1;
d=1;
for(k=3;k<=a;k++){
b=c;
c=d;
d=b+c;
}
return d;
}
| 61 |
30,298 | int main()
{
int f(int n);
int n,a,i;
scanf("%d",&n);
for(i=0;i<n;i++)
{
int s;
scanf("%d",&a);
s=f(a);
printf("%d\n",s);
}
getchar();
getchar();
}
int f(int n)
{
int z;
if(n==1||n==2)
z=1;
else
z=f(n-1)+f(n-2);
return(z);
}
| 61 |
30,299 | main()
{
int j;
int a[20];
a[0]=1;a[1]=1;
for(j=2;j<20;j++)
a[j]=a[j-1]+a[j-2];
int n,i,t;
int b[20];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&t);
b[i]=a[t-1];
}
for(i=0;i<n;i++)
printf("%d\n",b[i]);
getchar();
getchar();
}
| 61 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.