id
int32 0
32.5k
| code
stringlengths 95
8.4k
| label
stringclasses 65
values |
|---|---|---|
30,000 | int F(int n);
int main()
{
int n,x,i;
int p[100];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&x);
p[i]=F(x);
printf("%d\n",p[i]);
}
return 0;
}
int F(int n)
{
int a[1000];
a[0]=0;
a[1]=1;
int i;
for(i=2;i<=n;i++)
a[i]=a[i-1]+a[i-2];
if(i==1)
return 1;
else
return a[n];
} | 61 |
30,001 | /*
* opkp.cpp
*
* Created on: 2012-10-24
* Author: 1234
*/
int main()
{
int n;
int a,b,c;
int m[50];
a=b=c=1;
cin>>n;
for(int j=0;j<n;j++)
{
cin>>m[j];
a=b=1;
for(int i=0;i<m[j]-2;i++)
{
c=b;
b=a+b;
a=c;
}
cout<<b<<endl;
}
}
| 61 |
30,002 | int main()
{
int n;
scanf("%d",&n);
int a[100];
int i;
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
int b[100];
b[0]=1;
b[1]=1;
int j;
for(j=2;j<100;j++)
{
b[j]=b[j-1]+b[j-2];
}
printf("%d\n",b[a[i]-1]);
}
return 0;
}
| 61 |
30,003 | void main()
{
int num(k);
int n,i,m,k;
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%d",&k);
m=num(k);
printf("%d\n",m);
}
}
int num(k)
{
int p,a=0,b=1,c=1;
for(p=1;p<=k;p++)
{
a=b;
b=c;
c=a+b;
}
return (a);
} | 61 |
30,004 |
int main()
{
int data[20] = {1,1};
int n;
int a;
int i, j;
for(j = 2; j <= 19; j++)
data[j] = data[j - 2] + data[j - 1];
scanf("%d", &n);
for(i = 0; i <= n - 1; i++)
{
scanf("%d", &a);
printf("%d\n", data[a - 1]);
}
return 0;
}
| 61 |
30,005 | /*??????
??? 1200012876
2012?10?16?22:36:30 */
int main(){
int n,a[1000],b[1000],N[1000]; //??????
cin>>n; //????n
for(int j=1;j<=n;j++)
{
cin>>b[j]; //???????
if (b[j]<3)cout<<"1"<<endl; //????????3????1???
else //???3???????
{for(int i=3;i<=b[j];i++)
{
a[1]=1,a[2]=1;
a[i]=a[i-1]+a[i-2];
}
N[j]=a[b[j]]; //?a[????]?N[j]
cout<<N[j]<<endl; //?? N[j]
}}
return 0;
}
| 61 |
30,006 | int main()
{
int n,a,x,y,i,e,k;
scanf("%d",&n);
for(i=1;i<=n;i++){
scanf("%d",&a);
if(a==1){
printf("1\n");
}else if(a==2){
printf("1\n");
}else{
x=1,y=1;
for(k=3;k<=a;k++){
e=y;
y=x+y;
x=e;
}
printf("%d\n",y);
}
}
return 0;
} | 61 |
30,007 | int FN(int n);
int main()
{
int n,i;
int a[20];
int m[20];
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d",&a[i]);
}
for(i=0;i<n;i++){
m[i]=FN(a[i]);
}
for(i=0;i<n;i++){
printf("%d\n",m[i]);
}
return 0;
}
int FN(int n){
if(n==2||n==1){
return 1;
}
if(n>2){
return FN(n-1)+FN(n-2);
}
} | 61 |
30,008 | main()
{
int a,b,c,i,j;
int d[1000];
int e[1000];
scanf("%d",&a);
for(i=0;i<a;i++)
scanf("%d",&d[i]);
for(i=0;i<a;i++)
{e[0]=1;
e[1]=1;
if(d[i]<=2)
printf("1");
else
{for(j=2;j<d[i];j++)
e[j]=e[j-1]+e[j-2];
printf("%d\n",e[j-1]);
}
}
} | 61 |
30,009 | int main(){
int n,a[20],b[20],c[20],i,t,k,w;
scanf("%d",&n);
for(k=0;k<n;k++){
scanf("%d",&a[k]);
}
for(i=0;i<n;i++){
b[i]=0;
c[i]=1;
for(w=0;w<a[i]-1;w++){
t=b[i];
b[i]=c[i];
c[i]=b[i]+t;
}
printf("%d\n",c[i]);
}
return 0;
} | 61 |
30,010 | int main()
{
int k,a=1,b,c=2,d=0,e=1,f,h[a];
cin>>k;
for(a=1;a<=k;a++)
{cin>>b;
if(b==1) h[a]=b;
else
for(c=2;c<=b;c++) //??b????
{ f=(d+e);
d=e;
e=f;
}
h[a]=e;
e=1;
d=0;
}
for(a=1;a<=k;a++)
{cout<<h[a]<<endl;
}
return 0;
}
| 61 |
30,011 | int fun(int x);
int main()
{
int i,n,a[20];
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&a[i]);
for(i=0;i<n;i++)
printf("%d\n",fun(a[i]));
return 0;
}
int fun(int x)
{
int b[100],i;
if(x==1||x==2)return 1;
else
{
b[0]=b[1]=1;
for(i=2;i<x;i++)
b[i]=b[i-1]+b[i-2];
return b[i-1];
}
}
| 61 |
30,012 | int main()
{
int n,f[21],a[21],i;
scanf("%d",&n);
for (i=1;i<=n;i++)
scanf("%d",&a[i]);
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++)
printf("%d\n",f[a[i]]);
return 0;
} | 61 |
30,013 | int main()
{
int n, m, i, x, y, temp;
cin>>n;
while(cin>>m)
{
x=1;
y=1;
for (i=0;i<m-2;i++)
{
x=y+x;
temp=y;
y=x;
x=temp;
}
cout<<y<<endl;
}
return 0;
} | 61 |
30,014 | int main(){
int a=1,b=1,n,k,m,i;
cin>>n;
for(k=1;k<=n;k=k+1)
{
cin>>m;
a=1,b=1;//?????????????a ?b??
for(i=1;i<=(m-1)/2;i=i+1)
{
a=a+b;
b=a+b;
}
if(m%2==1)
{
cout<<a<<endl;
}
else
{
cout<<b<<endl;
}
}
return 0;
} | 61 |
30,015 | int main(){
int n,a;
scanf("%d",&n);
int i,t,I;
int c[10000];
int k=0;
for(I=0;I<n;I++){
int x=1;
int sum=1;
scanf("%d",&a);
if((a==2)||(a==1)){
c[k]=1;
k++;
}else if(a>2){
for(i=3;i<=a;i++){
t=sum;
sum=sum+x;
x=t;
}
c[k]=sum;
k++;
}
}int j;
for(j=0;j<k;j++){
printf("%d\n",c[j]);}
return 0;
}
| 61 |
30,016 | int main()
{
int sz[30];
int zs[25];
sz[0]=1;
sz[1]=1;
for(int i=2;i<30;i++){
sz[i]=sz[i-1]+sz[i-2];
}
int n,c,q;
scanf("%d",&n);
for(int j=0;j<n;j++){
scanf("%d",&(zs[j]));
}
for(int w=0;w<n;w++){
c=zs[w];
q=sz[c-1];
printf("%d\n",q);
}
}
| 61 |
30,017 | /*
* feibonaqi.cpp
*?? - 1063 ??????
*?? ?????????????: ?????????????1????????????2?????
???????a???????????a??????
* Created on: 2013-11-18
* Author: ???
*/
int f[20] = { 1 , 1 }; // ??????
void cal(int x){ // ????????
f[x] = f[ x - 1 ] + f[ x - 2 ];
}
int main(){
int n , a , needle = 1; // ??????????? needle ??
for(cin >> n; n --; ){
cin >> a;
for(int i = needle + 1; i < a; i ++) // ??????????? a ?
cal(i);
cout << f[ a - 1 ] << endl;
}
return 0;
}
| 61 |
30,018 |
int main(){
int a=0,b=0,c=1,m,n;
int x,y,z;
int result=0;
int sz[LEN];
scanf("%d",&m);
for(int i=0;i<m;i++)
{
scanf("%d",&(sz[i]));
for(int j=1;j<=sz[i];j++)
{
b=a+c;
c=a;
a=b;
result=b;
}
printf("%d\n",result);
a=0;
b=0;
c=1;
}
return 0;
}
| 61 |
30,019 | int main(){
int n,i,j,x=1,y=1,z;
cin>>n;
int a[n];
memset(a,0,sizeof(a));
for(i=0;i<=n-1;i++){
cin>>a[i];
}
for(i=0;i<=n-1;i++){
x=1;y=1;
for(j=1;j<=a[i];j++){
z=x+y;
x=y;
y=z;
}
cout<<y-x<<endl;
}
return 0;
}
| 61 |
30,020 | //
// main.cpp
// 10.15 homework
// ??????
// Created by airjcy on 10/8/12.
// Copyright (c) 2012 airjcy. All rights reserved.
//
int main(int argc, const char * argv[])
{
int n; //????
cin >> n;
int i;
for (i = 0; i < n; i++) {
int a = 1;
int b = 1;
int num; //??????
cin >> num;
int j;
int t;
for (j = 1; j < num; j ++) {
t = b;
b = a + b;
a = t;
}
cout << a << endl;
}
} | 61 |
30,021 | /*
* 5 1009.cpp
*
* Created on: 2013-10-9
* Author: weng
* ?????????????: ?????????????1?
* ???????????2?????
* ???????a???????????a??????
* ????
* ?1?????????n?????n????
* ???????1?????????a(1 <= a <= 20)
* ????
* n?????????????
* ???????????????????a?????
*/
int main()
{
int a[20],i=2,k=0,n;
cin>>n;
int b[n],j=0;
while(j<n)
{
cin>>b[j];
j++;
}
a[0]=1;
a[1]=1;
while(i<=19)
{
a[i]=a[i-1]+a[i-2];
i++;
}
while(k<n)
{
cout<<a[(b[k]-1)]<<"\n"<<endl;
k++;
}
return 0;
} | 61 |
30,022 |
int main()
{
int a[20]={1,1};
int i;
int N;
int b[20];
for (i=2;i<20;i++)
{
a[i]=a[i-1]+a[i-2];
}
scanf("%d",&N);
printf("\n");
for (i=0;i<=N-1;i++)
{
scanf("%d",&b[i]);
printf("\n");
}
for (i=0;i<=N-1;i++)
{
printf("%d",a[b[i]-1]);
printf("\n");
}
return 0;
} | 61 |
30,023 |
int main()
{
int n,a,i,j;
int c[22],b[22];
c[1]=1;
c[2]=1;
for (i=3;i<22;i++)
c[i]=c[i-1]+c[i-2];
scanf("%d",&n);
for (j=0;j<n;j++)
{
scanf("%d",&b[j]);
printf("%d\n",c[b[j]]);
}
}
| 61 |
30,024 |
int main()
{
int shu[20],fei[20],chu[20];
int n,i,j,b;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&shu[i]);
}
fei[0]=1;
fei[1]=1;
for(j=2;j<20;j++)
{
fei[j]=fei[j-1]+fei[j-2];
}
for(b=0;b<n;b++)
{
chu[b]=fei[shu[b]-1];
printf("%d\n",chu[b]);
}
return 0;
}
| 61 |
30,025 | int main()
{
int n;
int a[100000],b[100000];
int i,j;
scanf("%d",&n);
for(i=1;i<100000;i++)
{
if(i==1)
b[i]=1;
if(i==2)
b[i]=1;
if(i>2)
b[i]=b[i-2]+b[i-1];
}
for(i=0;i<n;i++)
{scanf("%d",&a[i]);
}
for(i=0;i<n;i++)
{
j=a[i];
printf("%d\n",b[j]);
}
return 0;
}
| 61 |
30,026 | void main()
{
int a,k,i,n;
int zhaodao(int a);
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a);
k=zhaodao(a);
printf("%d\n",k);
}
}
int zhaodao(int a)
{
if(a==1||a==2)
return(1);
else
return(zhaodao(a-1)+zhaodao(a-2));
}
| 61 |
30,027 | int fei(int n)
{
if(n==1||n==2)
return 1;
else
return fei(n-1)+fei(n-2);
}
int main()
{
int n;
scanf("%d",&n);
for(int i=0;i<n;i++)
{
int p=0;
scanf("%d",&p);
int q=fei(p);
printf("%d\n",q);
}
} | 61 |
30,028 | int a[25];
int fact(int b)
{
if(b==1)
{
a[1]=1;
return a[1];
}
else if(b==2)
{
a[2]=1;
return a[2];
}
else
{
a[b]=fact(b-1)+fact(b-2);
return a[b];
}
}
int main()
{
int n;
cin>>n;
for(int i=1;i<=n;i++)
{
int p;
cin>>p;
cout<<fact(p)<<endl;
}
return 0;
}
| 61 |
30,029 |
int n;
int num[maxx];
int com(int x)
{
if(x ==1 || x ==2)
{
return 1;
}
return com(x-1) + com(x-2);
}
int main()
{
int temp;
while(cin >> n)
{
while(n--)
{
cin >> temp;
cout << com(temp) <<endl;
}
}
return 0;
} | 61 |
30,030 | int main()
{
int n,i=0,num;
int feibo[21]={1,1,1,2,3,5,8,13,21,34,55,89,144,233,377,610,987,1597,2584,4181,6765};
cin>>n;
while(i<n)
{
cin>>num;
cout<<feibo[num]<<endl;
i++;
}
return 0;
} | 61 |
30,031 | /*
* phoenix3+1.cpp
*Author: ???
* Created on: 2013-9-28
* ??????
*/
int main()
{
int i,n,c,a[20],b[20];
cin>>n;
for (i=0;i<n;i++)
{
cin>>a[i];
}
for(i=0;i<20;i++)
{
if((i==0)||(i==1))
b[i]=1;
else b[i]=b[i-1]+b[i-2];
}
for(i=0;i<n;i++)
{
c=a[i];
cout<<b[c-1]<<endl;
}
return 0;
}
| 61 |
30,032 |
int f[100],i ,j ,k;
void cal()
{
f[0]=1;
f[1]=1;
f[2]=1;
int i;
for(i=3;i<21;i++)
{
f[i] = f[i-1] + f[i-2];
}
}
int main()
{
int n;
cin>>n;
cal();
while(n--)
{
int m;
cin>>m;
cout<<f[m]<<endl;
}
return 0;
}
| 61 |
30,033 |
int f(int str[], int i)
{
if (i == 0)
return str[0];
else if (i == 1)
return str[1];
else
{
str[i] = f(str, i-1) + f(str, i-2);
return str[i];
}
}
int main()
{
int str[22] = {1, 1};
int a, n;
cin >> n;
for ( ; n > 0; n--)
{
cin >> a;
cout << f(str, a - 1) << endl;
}
return 0;
} | 61 |
30,034 | int s[100];
int sl(int i,int n);
int main()
{
int i;
int n;
int s[100];
int a[100];
int b[100];
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d",&a[i]);
}
for(i=0;i<n;i++){
b[i]=sl(i,a[i]);
printf("%d\n",b[i]);
}
return 0;
}
int sl(int i,int n){
int r;
s[0]=1;
s[1]=1;
for(i=2;i<n;i++){
s[i]=s[i-1]+s[i-2];
}
r=s[n-1];
return r;
}
| 61 |
30,035 | int main( )
{
int n,i,b[100001],a[100000],m=1;
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%d",&a[i]);
if(m<a[i])
{
m=a[i];
}
}
b[1]=1;
b[2]=1;
for(i=3;i<=m;i++)
{
b[i]=b[i-1]+b[i-2];
}
for(i=1;i<=n;i++)
{
printf("%d\n",b[a[i]]);
}
return 0;
}
| 61 |
30,036 | int f(int n)
{
if(n==1)
return 1;
if(n==2)
return 1;
return (f(n-1)+f(n-2));
}
int main()
{
int n,i,a;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a);
printf("%d\n",f(a));
}
getchar();
getchar();
} | 61 |
30,037 |
int main()
{
int a[1000],b[1000],i,zhishu,shu;
for(i=0;i<1000;i++){
if(i==0){
a[0]=1;
}
else{
if(i==1){
a[i]=1;
}
else{
a[i]=a[i-1]+a[i-2];
}
}
}
scanf("%d",&zhishu);
for(i=0;i<zhishu;i++){
scanf("%d",&shu);
b[i]=a[shu-1];
}
for(i=0;i<zhishu;i++){
printf("%d\n",b[i]);
}
return 0;
}
| 61 |
30,038 | int dota(int n)
{
if(n==1||n==2) return(1);
else return(dota(n-1)+dota(n-2));
}
main()
{
int i,n;
scanf("%d",&n);
for(i=0;i<n;i++)
{
int a;
scanf("%d",&a);
int m;
m=dota(a);
printf("%d\n",m);
}
} | 61 |
30,039 | main()
{
int a,i,j,n,f[30];
f[0]=1;f[1]=1;
scanf("%d",&n);
for(i=0;i<n;i++)
{
for(j=2;j<30;j++)f[j]=0;
scanf("%d",&a);
if(a<=2)printf("1\n");
else
{
for(j=2;j<a;j++)
{
f[j]=f[j-1]+f[j-2];
}
printf("%d\n",f[a-1]);
}
}
}
| 61 |
30,040 |
int main()
{
long n,i,j,a[20],c,d,e;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&a[i]);
for(i=0;i<n;i++)
{
c=1,d=1,e=1;
for(j=2;j<a[i];j++)
{
e=c+d;
c=d,d=e;
}
printf("%d\n",e);
}
return 0;
} | 61 |
30,041 |
int a[20]={1,1}; //???????????2?????????????2???
//??????????a[2]?a[3]?????????
//??a[2]?????a???????4??????????????????????????????
//???????????????????????????????????????wrong answer?
//???????????????????????????????????????????????
//???????????????a(1 <= a <= 20)???????int a[20]={1,1};
int n,i,k,j;
int main()
{
cin>>n;
for(i=1;i<=n;i++)//???
{
cin>>k;
if(k>2)
{
for(j=2;j<=k-1;j++)
{
a[j]=a[j-1]+a[j-2];//????
}
}
cout<<a[k-1]<<endl;
}
return 0;
}
| 61 |
30,042 | void main()
{
int f(int j);
int n,i,j;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&j);
printf("%d\n",f(j));
}
}
int f(int j)
{
int x=0;
if(j==1||j==2)x=1;
else x=f(j-1)+f(j-2);
return x;
} | 61 |
30,043 | int f(int x)
{
int s;
if(x==1||x==2)
{
s=1;
}
else
{
s=f(x-1)+f(x-2);
}
return s;
}
main()
{
int n,i;
int a[25];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
if(a[i]==1||a[i]==2)
{
printf("1\n");
}
else
{
printf("%d\n",f(a[i]));
}
}
}
| 61 |
30,044 |
int F(int a){
int result;
if(a==1||a==2)
return 1;
else{
result=F(a-1)+F(a-2);
return result;
}
}
int main(){
int n,in[21],out[21],i,q;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d",&in[i]);
out[i]=F(in[i]);
}
for(i=0;i<n;i++)
printf("%d\n",out[i]);
scanf("%d\n",&q);
return 0;
}
| 61 |
30,045 | int main()
{
int Fibonacci(int n);int n,i,a[20];
scanf("%d",&n);
for(i=1;i<=n;i++)
scanf("%d",&a[i-1]);
for(i=1;i<=n;i++)
printf("%d\n",Fibonacci(a[i-1]));
return 0;
}
int Fibonacci(int n)
{
int a;
if(n==1) a=1;
else
if(n==2) a=1;
else
a=Fibonacci(n-1)+Fibonacci(n-2);
return(a);
} | 61 |
30,046 | int n;
int a[100];
int main(){
a[1] = 1;
a[2] = 1;
for(int i = 3; i <= 20; i++){
a[i] = a[i-1] + a[i-2];
}
cin >> n;
int t;
for(int i = 0; i < n; i++){
cin >> t;
cout << a[t] << endl;
}
} | 61 |
30,047 | int value(int a){
int p=1,q=1,i,result;
if(a>=3){
for(i=3;i<=a;i++){
result=p+q;
p=q;
q=result;
}
}else{
result=1;
}
return result;
}
int main(){
int a,i,n,result;
scanf("%d",&n);
for(i=1;i<=n;i++){
scanf("%d",&a);
result=value(a);
printf("%d\n",result);
}
return 0;
} | 61 |
30,048 | int main()
{int a[20];
int n;
cin>>n;
int f[21];
f[1]=1;
f[2]=1;
for(int j=3;j<=20;j++)
f[j]=f[j-1]+f[j-2];
for(int i=0;i<n;i++)
cin>>a[i];
for(int i=0;i<n;i++)
cout<<f[a[i]]<<endl;
return 0;
}
| 61 |
30,049 |
int main() {
int n=0;
int a=0;
int x=1;
int y=1;
int z=0;
int j=0;
cin>>n;
for(int b=1;b<=n;b=b+1)
{
cin>>a;
for(int i=1;i<=a;i=i+1)
{
j=i%3;
if(j==2)
y=x+z;
if(j==1)
x=y+z;
if(j==0)
z=x+y;
}
int b=0;
int c=0;
b=max(x,y);
c=max(b,z);
cout<<c<<endl;
x=1;
y=1;
z=0;
}
return 0;
} | 61 |
30,050 |
int main() {
int zu;
cin >> zu;
for(int i=1;i<=zu;i++){
int j;cin>>j;
switch (j){
case 1: cout << 1 << endl;break;
case 2: cout << 1 << endl;break;
default:{int x1=1,x2=1;
for(int k=3;k<=j;k++){
x2=x1+x2;x1=x2-x1;
}
cout << x2 << endl;
}
}
}
return 0;
}
| 61 |
30,051 | int f(int x)
{
if(x==1||x==2)
return 1;
else
return (f(x-1)+f(x-2));
}
int main()
{
int n,i,k,m;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&k);
m=f(k);
printf("%d\n",m);
}
getchar();
getchar();
}
| 61 |
30,052 | int main()
{
int n,a,b[20];
int i,j;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a);
b[0]=1;b[1]=1;
if(a==1||a==2) printf("1\n");
else
{for(j=2;j<a;j++)
b[j]=b[j-2]+b[j-1];
printf("%d\n",b[a-1]);}
}
getchar();
getchar();
} | 61 |
30,053 | int main(){
int n,a,b,c,i,j,m,sz[100];
scanf("%d",&m);
for(j=0;j<m;j++){
scanf("%d",&n);
a=1;
b=1;
if(n==1||n==2){
c=1;
}else if(n>=3){
for(i=3;i<=n;i++){
c=a+b;
a=b;
b=c;
}
}
sz[j]=c;
}
for(j=0;j<m;j++){
printf("%d\n",sz[j]);
}
return 0;
}
| 61 |
30,054 | int fbn(int);
int main(){
int n;
cin>>n;
int i=0,a[1000];
for(i=0;i<n;i++)
cin >> a[i];
for(i=0;i<n;i++)
cout<<fbn(a[i])<<endl;
return 0;
}
int fbn(int n)
{
int c;
if(n==1||n==2)c=1;
else c=fbn(n-1)+fbn(n-2);
return c;
} | 61 |
30,055 | int main()
{
int a[21],i,b[21],n;
scanf("%d",&n);
b[0]=1;
b[1]=1;
for(i=2;i<=20;i++)
b[i]=b[i-1]+b[i-2];
for(i=1;i<n;i++)
{
scanf("%d",&a[i-1]);
printf("%d\n",b[(a[i-1]-1)]);
}
scanf("%d",&a[n-1]);
printf("%d",b[(a[n-1])-1]);
return 0;
}
| 61 |
30,056 | int f(int n)
{
if(n==1||n==2)
return 1;
else return f(n-1)+f(n-2);
}
int main()
{
int i,n,a[10000],result[1000];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
result[i]=f(a[i]);
printf("%d\n",result[i]);
}
} | 61 |
30,057 | int shulie(int);
int num[100] = {0};
int main()
{
int a, n, k;
cin >> n;
for (k = 0; k < n; k++)
{
cin >> a;
cout << shulie(a) << endl;
}
return 0;
}
int shulie(int a)
{
if (a == 1 || a == 2)
return 1;
num[a] = shulie(a -1) + shulie(a - 2);
return num[a];
}
| 61 |
30,058 | /*
* Name?fenli.cpp
*
* Created on: 2012-10-16
* Author: 00948343_??
* Function??????????
*/
int main(){
int n, count, sum1=0, sum2=0, sum3=0;
cin >> n;
for (int i=0;i<n;i++){
cin >> count;
for (int j=0;j<count;j++){
if (j==0){
sum1=1;
sum2=1;
sum3=1;
}
else if (j==1){
sum1=1;
sum2=1;
sum3=1;
}
else{
sum1=sum2;
sum2=sum3;
sum3=sum1+sum2;
}
}
cout << sum3 <<'\n';
sum3=0, sum1=0, sum2=0;
}
}
| 61 |
30,059 | int main()
{
int a[10000],b[10000],n,i=3,j=1;
memset(a,0,sizeof(a));
memset(b,0,sizeof(b));
b[1]=1;
b[2]=1;
cin>>n;
for(j=1;j<=n;j++)
{
cin>>a[j];
}
for(i=3;i<=10000;i++)
{
b[i]=b[i-1]+b[i-2];
}
for(j=1;j<=n;j++)
{
cout<<b[a[j]]<<endl;
}
return 0;
}
| 61 |
30,060 | int main()
{
int a[100]={1,1,1,1};
int i=0;
int *p=a+3;
for(i=0;i<100;i++)
{
*(p+i)=*(p+i-1)+*(p+i-2);
//cout<<*(p+i)<<endl;
}
int n;
cin>>n;
i=0;
while(i<n)
{
int m;
cin>>m;
cout<<a[m]<<endl;
i++;
}
} | 61 |
30,061 | int num[30]={0,1,1};
void fib()
{
for(int i=2;i<30;i++)
num[i]=num[i-1]+num[i-2];
}
int main()
{
int n;
cin>>n;
fib();
while(n--)
{
int a;
cin>>a;
cout<<num[a]<<endl;
}
return 0;
}
| 61 |
30,062 | int f(int n)
{
if(n==1||n==2)
return 1;
else
return f(n-1)+f(n-2);
}
int main()
{int n;
scanf("%d",&n);
while(scanf("%d",&n)!=EOF)
printf("%d\n",f(n));
}
| 61 |
30,063 | int F(int n)
{
int f;
if(n==1||n==2)
{
f=1;
}
else
{
f=F(n-1)+F(n-2);
}
return (f);
}
int main()
{
int n,i,a;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a);
printf("%d\n",F(a));
}
return 0;
}
| 61 |
30,064 | //
// main.cpp
// poj
//
// Created by ChuPan,Wong on 9/27/13.
// Copyright (c) 2013 ChuPan,Wong. All rights reserved.
//
int main(int argc, const char * argv[])
{
int num[20];
num[0]=num[1]=1;
for(int i=2;i<20;i++){
num[i] = num[i-1]+num[i-2];
}
int n;
cin>>n;
int x;
while(n--){
cin>>x;
cout<<num[x-1]<<endl;
}
return 0;
}
| 61 |
30,065 | int main(){
int i,j,n,a,x[20];
x[1]=1;x[2]=1;
cin>>n;
for(j=1;j<=n;j++){
cin>>a;
if(a==1)cout<<"1";
else if(a==2)cout<<"1";
else {{for(i=3;i<=a;i++)
x[i]=x[i-1]+x[i-2];}
cout<<x[a]<<endl;}
}
} | 61 |
30,066 | int main()
{
int n,i,j,sum;
int sz[10000],b[30];
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&sz[i]);
for(i=0;i<n;i++)
{
if(sz[i]==1||sz[i]==2){
sum=1;
}else {
for(j=3;j<=sz[i];j++)
{
b[1]=1;
b[2]=1;
b[j]=b[j-2]+b[j-1];
sum=b[j];
}
}
printf("%d\n",sum);
}
return 0;
}
| 61 |
30,067 | int main()
{
int n=0,a0=1,a1=1,a3=0,i=0,num[10],j=0;
cin>>n;
for(i=0;i<n;i++)
{
a1=1;
a0=1;
cin>>num[i];
if(num[i]>2)
{
for(j=0;j<(num[i]-2);j++)
{
a3=a0+a1;
a0=a1;
a1=a3;
}
cout<<a1<<endl;
}
if(num[i]==1||num[i]==2)
cout<<a1<<endl;
}
return 0;
} | 61 |
30,068 | //********************
//*??; ??????*
//*??:??? *
//*2012-12-19 *
//********************
int main()
{
int n, a, i=1, j=1, m[30]; //?????????
cin >> n;
for (i=1;i<=n;i++)
{
int m[30]={1,1}; //???????????2??1
cin >> a; //??????
for (j=2;j<=a-1;j++) //???????3????
{
m[j]=m[j-1]+m[j-2];
}
cout << m[a-1] << endl;//????
}
return 0;
} | 61 |
30,069 | void main(){
int n,a[10050];
int i,j,num;
scanf("%d",&n);
a[1]=1;a[2]=1;
for(j=1;j<10000;j++){
a[j+2]=a[j+1]+a[j];
}
for(i=0;i<n;i++){
scanf("%d",&num);
if(num==0)
printf("0\n");
else if(num==1)
printf("1\n");
else
printf("%d\n",a[num]);
}
}
| 61 |
30,070 | int F(int n);
int main()
{
int n,b,p,q;
scanf("%d",&p);
for (q=0;q<p;q++){
scanf("%d",&n);
b=F(n);
printf("%d\n",b);
}
return 0;
}
int F(int n){
int a[100],i;
a[1]=1;
a[2]=1;
a[3]=2;
if(n>3){
for(i=3;i<=n;i++){
a[i]=a[i-1]+a[i-2];
}
return a[n];
}
if (n==1||n==1){
return 1;
}
} | 61 |
30,071 | main()
{
int t[20],n,i,j,a,b,c;
i=0;
scanf("%d",&n);
while (i<n)
{
scanf("%d",&t[i]);
i=i+1;
}
i=0;
while (i<n)
{
a=1;
b=1;
j=1;
while (j<t[i])
{
c=b;
b=a+b;
a=c;
j=j+1;
}
printf("%d\n",a);
i=i+1;
}
} | 61 |
30,072 | int main()
{
int i,n,j,t;
int a[20]={1,1,2,3,5,8,13,21,34,55,89,144,233,377,610,987,1597,2584,4181,6765};
int b[20];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&j);
b[i]=j-1;
}
for(i=0;i<n;i++)
{
t=b[i];
printf("%d\n",a[t]);
}
return 0;
} | 61 |
30,073 | int main ()
{
int a[20],n,i=1; //????????????????.??????????a[],????a?????
cin >> n;
while(i <= n)
{
cin >> a[i];
i = i + 1;
}
int C;
i = 1;
while(i <= n)
{
if(a[i] == 1) //????????????????????
{cout << "1" << endl;
i = i + 1;}
else if(a[i] == 2)
{
cout << "1" << endl;
i = i + 1;
}
else
{
int A=1,B=1;
while(a[i]-2 > 0) //??????????????
{
C = A + B; //?????????????
A = B;
B = C;
a[i] = a[i] - 1;
}
cout << C << endl;
i = i + 1;
}
}
return 0;
}
| 61 |
30,074 |
int f[25];
int cal(int t)
{
if(t==1 || t==2)
{
f[t]=1;
return 1;
}
if(f[t]<0)
{
f[t]=cal(t-1)+cal(t-2);
}
return f[t];
}
int main()
{
int n;
cin>>n;
memset(f,-1,sizeof(f));
while(n--)
{
int t;
cin>>t;
cout<<cal(t)<<endl;
}
return 0;
} | 61 |
30,075 | int F(int n);
int main()
{
int n,m[999],j=0;
scanf("%d",&n);
for(j=0;j<n;j++)
{
scanf("%d",&m[j]);
}
j=0;
for(j=0;j<n;j++)
{
printf("%d\n",F(m[j]));
}
return 0;
}
int F(int n)
{
int k[999];
int i=1;
k[1]=1;
k[2]=1;
if(n==1)
return 1;
if(n==2)
return 1;
else
for(i=3;i<=n;i++)
{
k[i]=k[i-1]+k[i-2];
}
return k[n];
}
| 61 |
30,076 | int f(int a)
{
if(a==1||a==2)
return 1;
else
return (f(a-1)+f(a-2));
}
int main()
{
int n,i,k;
scanf("%d",&n);
int a[n],b[n];
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
b[i]=f(a[i]);
printf("%d\n",b[i]);
}
getchar();
getchar();
} | 61 |
30,077 | int a[20];
int f(int i)
{
if (i==1||i==2)
{
a[i]=1;
return 1;
}
else
{
a[i]=f(i-1)+f(i-2);
return (f(i-1)+f(i-2));
}
}
main()
{
int n,i,b;
scanf("%d",&n);
for (i=0;i<n;i++)
{
scanf("%d",&b);
printf("%d\n",f(b));
}
getchar();
getchar();
} | 61 |
30,078 | /*
*???: fibonacci.cpp
*??: ???
*????: 2012-10-13
*??: ?????????a??
*/
const int AMAX=20;
int main()
{
int fib[AMAX+1]; //??????????20?
fib[1]=fib[2]=1;
for (int i=3;i<=AMAX;i++){
fib[i]=fib[i-1]+fib[i-2]; //??fib[i],i=3,4,...,20
}
int n,a;
cin >> n;
while (n--){
cin >> a;
cout << fib[a] <<endl;
}
return 0;
}
| 61 |
30,079 | int main()
{
int n, i, j, t1, t2,t;
cin >> n;
int a[21],b[21];
for(i = 0; i < n; i ++)
cin >> a[i];
for(i = 0; i < n; i++)
{
b[i] = 0;
for(j = 1; j <= a[i]; j ++)
{
if(j == 1 || j == 2)
{
t1 = 1;
t2 = 1;
}
else
{
t = t1;
t1 = t2;
t2 = t2 + t;
}
}
b[i] = t2;
cout << b[i] << endl;
}
return 0;
}
| 61 |
30,080 | main()
{
int i,j,n,m;
int f[20]={1,1},a[100];
scanf("%d",&n);
for(i=1;i<=n;i++)
{scanf("%d",&m);
for(j=2;j<20;j++)
f[j]=f[j-2]+f[j-1];
printf("%d\n",f[m-1]);
}
getchar();
getchar();
} | 61 |
30,081 | int fibo(int n)
{
if (n==1||n==2) return(1);
return(fibo(n-1)+fibo(n-2));
}
void main()
{
int n,i,a;
scanf("%d",&n);
for (i=0;i<n;i++)
{
scanf("%d",&a);
printf("%d\n",fibo(a));
}
} | 61 |
30,082 | int main() {
int n,a,i,p,q,result;
scanf("%d",&n);
while(n--){
scanf("%d",&a);
if((a==1)||(a==2)){
printf("1\n");
}
else{
p=1;
q=1;
for(i=2;i<a;i++){
result=p+q;
p=q;
q=result;
}
printf("%d\n",result);
}
}
return 0;
} | 61 |
30,083 | int main(){
int n,m,i,j,a[20],c[100];
scanf("%d",&n);
for(i=0;i<n;i++){
a[0]=1;
a[1]=1;
c[i]=0;
scanf("%d",&m);
if(m==1||m==2){
c[i]=1;
}
else{
c[i]=2;
for(j=2;j<m;j++){
a[j]=a[j-2]+a[j-1];
c[i]=a[j];
}
}
}
for(i=0;i<n;i++){
printf("%d\n",c[i]);
}
return 0;
} | 61 |
30,084 | int main(){
int n,a=1,b=1,sz[20],i,c=0,j;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d",&sz[i]);
}
for(i=0;i<n;i++){
if(sz[i]<=2){
b=1;
printf("%d\n",b);
}
else{
for(j=0;j<sz[i]-2;j++){
c=b;
b=a+b;
a=c;
}
printf("%d\n",b);
}
a=1;
b=1;
}
return 0;
} | 61 |
30,085 | int F(int m)
{
int f[m],i;
for(i=0;i<m;i++)
{
if(i==1||i==0)
{
f[i]=1;
}else{
f[i]=f[i-1]+f[i-2];
}
}
return f[m-1];
}
int main()
{
int n,j;
scanf("%d",&n);
int s[n],r[n];
for(j=0;j<n;j++)
{
scanf("%d",&s[j]);
r[j]=F(s[j]);
}
for(j=0;j<n;j++)
{
printf("%d\n",r[j]);
}
return 0;
} | 61 |
30,086 |
int feibo(int m)
{
if (m==1||m==2)
return 1;
else
return feibo(m-1)+feibo(m-2);
}
int main(int argc, char *argv[])
{
int n,i,place;
scanf("%d",&n);
for (i=0;i<=n-1;i++)
{
scanf("%d",&place);
printf("%d\n",feibo(place));
}
return 0;
}
| 61 |
30,087 | int main(){
int n,i,m,t,p,s;
int a[100],b[100];
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d",&a[i]);
m=1;
t=1;
for(s=3;s<=a[i];s++){
p=t;
t=t+m;
m=p;
}
b[i]=t;
}
for(i=0;i<n;i++){
printf("%d\n",b[i]);
}
return 0;
} | 61 |
30,088 | int f(int n);
int main(){
int n,i;
int x;
int a[1000];
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d",&a[i]);
}
for(i=0;i<n;i++){
x=f(a[i]-1);
printf("%d\n",x);
}
return 0;
}
int f(int n){
if(n==0){
return 1;
}
if(n==1){
return 1;
}
if(n>1){
return f(n-1)+f(n-2);
}
}
| 61 |
30,089 | int main()
{
int *p,i,n,j,k;
p=(int*)malloc(10000*sizeof(int));
*(p+1)=*p=1;
scanf("%d",&n);
for(j=0;j<n;j++)
{
scanf("%d",&k);
if(k>2)
{
for(i=2;i<k;i++)
*(p+i)=*(p+i-1)+*(p+i-2);
printf("%d\n",*(p+k-1));
}
else printf("%d\n",*(p+k-1));
}
}
| 61 |
30,090 | int main(){
int i,n,len,a[100],s[100],re[100],j;
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){
re[i]=1;
}
else {
s[0]=1;s[1]=1;
for(j=2;j<a[i];j++){
s[j]=s[j-1]+s[j-2];
}
re[i]=s[j-1];
}
}
for(i=0;i<n;i++){
printf("%d\n",re[i]);
}
return 0;} | 61 |
30,091 | int main ()
{
int n ;
cin >> n ;
int bfnq [n];
int i , j ;
for (i=0;i<n;i++)
cin >> bfnq [i];//??
int a1=1 , a2=1 ;
for (i=0; i<n; i++)//n?????
{ a1=1;
a2=1;
if(bfnq[i]==1||bfnq[i]==2)
cout <<"1"<<endl;
else if(bfnq[i]%2==1)
{
for (j=3; j<=bfnq[i]; j+=2)
{
a1=a1+a2;
a2=a1+a2;
}
cout << a1<<endl ;
}
else
{
for(j=3; j<=bfnq[i]; j+=2)
{
a1=a1+a2;
a2=a1+a2;
}
cout << a2 << endl ;
}
}
return 0;
}
| 61 |
30,092 | int main(){
int n,x,i=1,j,a,b,c;
scanf("%d",&n);
while(i<=n){
scanf("%d",&x);
j=1;
a=1;
b=1;
while(j<=x-1){
c=a+b;
a=b;
b=c;
j++;
}
printf("%d\n",a);
i=i+1;
}
return 0;
} | 61 |
30,093 | int main()
{
int k;
cin>>k;
int b[k];
for(int i=0;i<k;i++)
{int a;
cin>>b[i];
double n;
n=b[i];
a=sqrt(5);
a=((pow(((1+sqrt(5))/2),n)-(pow(((1-sqrt(5))/2),n)))/sqrt(5));
cout<<a<<endl;
}
return 0;
} | 61 |
30,094 |
int main()
{
int a1=1, a2=1, ai, n, a;
cin >> n;
for (int i=0; i < n; i++)
{
cin >> a;
if(a==1 || a==2)
cout << a1 << endl;
else
{
for(int j=3; j <= a;j++)
{
ai = a1 + a2;
a1 = a2;
a2 = ai;
}
cout << ai << endl;
a1 = 1;
a2 = 1;
}
}
return 0;
} | 61 |
30,095 | int main()
{
int i,n,a[20],m;
int f[20]={1,1};
for(i=2;i<20;i++)
f[i]=f[i-2]+f[i-1];
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%d",&m);
a[i]=f[m-1];
}
for(i=1;i<=n;i++)
printf("%d\n",a[i]);
getchar();
getchar();
return 0;
}
| 61 |
30,096 | int fei (int a)
{
int t;
if (a==1)
return 1;
if (a==2)
return 1;
if ( a!=1 && a!=2 )
{
t=fei (a-1)+fei (a-2);
return t;
}
}
int main ()
{
int n,i;
int t[20];
scanf ("%d",&n);
for (i=0;i<n;i++)
{
scanf ("%d",&t[i]);
}
for (i=0;i<n;i++)
{
printf ("%d\n",fei(t[i]));
}
getchar ();
getchar ();
}
| 61 |
30,097 | int fei(int a)
{
if (a == 1 || a == 2)
{
return 1;
}
else
{
return fei(a - 1) + fei(a - 2);
}
}
int main()
{
int n, i, m;
cin >> n;
for (i = 1; i <= n; i++)
{
cin >> m;
cout << fei(m) << endl;
}
return 0;
} | 61 |
30,098 | int f(int a)
{
int num[21];
if (a==1) num[1]=1;
if (a==2) num[2]=1;
if (a>2) num[a]=f(a-1)+f(a-2);
return (num[a]);
}
main()
{
int i,n,a,r;
scanf("%d",&n);
for (i=1;i<=n;i++)
{
scanf("%d",&a);
r=f(a);
printf("%d\n",r);
}
}
| 61 |
30,099 | int main()
{
int n,s[20],i,j,a,b,c;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&(s[i]));
}
for(i=0;i<n;i++)
{
if(s[i]<=2)
printf("1\n");
if(s[i]>2)
{
a=1;
b=1;
for(j=3;j<=s[i];j++)
{
c=a+b;
a=b;
b=c;
}
printf("%d\n",c);
}
}
return 0;
}
| 61 |
Subsets and Splits