label
stringlengths 1
2
| index
stringlengths 1
5
| code
stringlengths 87
8.24k
|
|---|---|---|
61 | 30100 |
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 | 30101 | /*
* ??????.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 | 30102 |
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 | 30103 | int F_num[10000];
int main()
{
int test_total,max = 0,test_site;
int i,j,k;
F_num[0]=1;
F_num[1]=1;
max = 1;
scanf ("%d",&test_total);
for (i=0; i<test_total; i++)
{
scanf ("%d", &test_site);
if (max >= test_site)
{
printf("%d\n", F_num[test_site-1]);
}
else
{
for(j=max +1; j<=test_site; j++)
{
F_num[j] = F_num[j-1]+F_num[j-2];
}
max = test_site;
printf("%d\n", F_num[test_site-1]);
}
}
return 0;
}
|
61 | 30104 | 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 | 30105 | 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 | 30106 | 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 | 30107 | //??
//?????????????: ?????????????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 | 30108 |
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 | 30109 | 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 | 30110 | 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 | 30111 | int main()
{
int n,i,j,k,c;
int a[21];
scanf("%d",&n);
for (j=1;j<=n;j++)
{
scanf("%d",&k);
for(i=3;i<=k;i++)
{
a[1]=1;
a[2]=1;
a[i]=a[i-1]+a[i-2];
}
c=a[k];
printf("%d\n",c);
}
getchar();
getchar();
}
|
61 | 30112 |
int main()
{
int n,i,j,k,a[10000],b[30],c[10000];
scanf("%d",&n);
for (i=0;i<n;i++){
scanf("%d",&a[i]);
}
for (i=0;i<n;i++){
for (j=0;j<a[i];j++){
b[0]=1;
b[1]=1;
b[j+2]=b[j]+b[j+1];
c[i]=b[j];
}
}
for (k=0;k<n;k++){
printf("%d\n",c[k]);
}
return 0;
}
|
61 | 30113 | 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 | 30114 | 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 | 30115 | int fibonacci(int n)
{
int x;
if(n==1||n==2){
x=1;
}
else{
x=fibonacci(n-1)+fibonacci(n-2);
}
return x;
}
int main()
{
int n,i,m,a;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d",&a);
m=fibonacci(a);
printf("%d\n",m);
}
return 0;
}
|
61 | 30116 | int main()
{int i,a[20],m,n;
scanf("%d",&n);
a[0]=1;
a[1]=1;
for(i=2;i<20;i++)
a[i]=a[i-1]+a[i-2];
i=0;
while(i<n)
{ scanf("%d",&m);
if(i==n-1)
{printf("%d",a[m-1]);return 0;}
else
printf("%d\n",a[m-1]);
i++;
}
return 0;
} |
61 | 30117 | 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 | 30118 |
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 | 30119 | main()
{
int a[10000];
int n,i,b;
scanf("%d",&n);
for(i=0;i<n;i++)
{ int sum=0;
scanf("%d",&b);
sum=fei(b);
printf("%d\n",sum);
}
}
int fei(int n)
{
if(n==1)
return 1;
if(n==2)
return 1;
return (fei(n-1)+fei(n-2));
} |
61 | 30120 | 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 | 30121 | int fei(int k)
{
int f[21] = {0};
f[1] = 1;
f[2] = 1;
int i;
for (i = 3; i <= 21; i ++)
{
f[i] = f[i - 1] + f[i - 2];
}
return f[k];
}
int main()
{
int i, n, a;
cin >> n;
for (i = 0; i < n; i ++)
{
cin >> a;
cout << fei(a) << endl;
}
return 0;
}
|
61 | 30122 |
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 | 30123 | 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 | 30124 | 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 | 30125 | 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 | 30126 | 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 | 30127 | 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 | 30128 | 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 | 30129 | /*
* 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 | 30130 | 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 | 30131 | main()
{
int n;
scanf("%d",&n);
int fb[29];
fb[1]=1;
fb[2]=1;
int i;
for(i=3;i<22;i++)
{
fb[i]=fb[i-1]+fb[i-2];
}
//for(i=1;i<21;i++)
// printf("%d ",fb[i]);
for(;n>0;n--)
{
int a;
scanf("%d", &a);
printf("%d\n",fb[a]);
}
}
|
61 | 30132 |
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 | 30133 | /*
* Fib.cpp
*
* Created on: 2013-10-1
* Author: KEVIN
*/
int fibs[19];//????????????????????
int Fib(int i)
{
if(fibs[i-1]!=0)return fibs[i-1];//????????????
else
{
//?????????????
if(i==1||i==2)
{
fibs[i-1]=1;
return 1;
}
else
{
fibs[i-1]=Fib(i-1)+Fib(i-2);
return fibs[i-1];
}
}
}
int main()
{
for(int i=0;i<=19;i++)fibs[i]=0;//???0
int n;
cin>>n;
while(n)
{
int a;
cin>>a;
cout<<Fib(a)<<endl;
n--;
}
return 0;
} |
61 | 30134 | 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 | 30135 | 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 | 30136 | 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 | 30137 | /*
* 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 | 30138 | 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 | 30139 | /*
* 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 | 30140 | 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 | 30141 |
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 | 30142 |
int main(int argc, char* argv[])
{
int n,i,j;
scanf("%d",&n);
int a[1000];
for(i=0;i<n;i++){
scanf("%d",&a[i]);
}
int y[30];
for(i=0;i<n;i++){
for(j=0;j<a[i];j++){
if(j==0){
y[0]=1;
}else if(j==1){
y[1]=1;
}else{
y[j]=y[j-1]+y[j-2];
}
}
printf("%d\n",y[j-1]);
}
return 0;
}
|
61 | 30143 | 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 | 30144 | 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 | 30145 |
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 | 30146 | 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 | 30147 | 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 | 30148 | /*
*??????????.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 | 30149 | 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 | 30150 | 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 | 30151 | 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 | 30152 |
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 | 30153 | 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 | 30154 | 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 | 30155 |
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 | 30156 | 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 | 30157 |
int main()
{
int a[20]={1,1};
int i=0;
for (i=2;i<=20;i++) a[i]=a[i-1]+a[i-2];//?20?
int n=0;
cin>>n;
int b[100]={0};//????
for (i=0;i<=n-1;i++)
{
cin>>b[i];
}
for (i=0;i<=n-1;i++)
{
cout<<a[b[i]-1]<<endl;
}
return 0;
} |
61 | 30158 | 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 | 30159 | 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 | 30160 | 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 | 30161 | /*
* 38.cpp
*??????
* Created on: 2012-11-2
* Author: ???
*/
int main() { //?????
int i, j, n, m; //??int???
int f[25]; //????f
f[1] = 1;
f[2] = 1; //???f[1],f[2]??
cin >> m; //??????
for (j = 1; j <= m; j++) {
cin >> n; //?????n
if ((n == 1) || (n == 2)) {
cout << f[n] << endl;
} //??n??1?2???1
else {
for (i = 3; i <= n; i++) {
f[i] = f[i - 1] + f[i - 2];
} //??n??2????????
cout << f[n] << endl; //????
}
}
return 0; //?????
}
|
61 | 30162 | 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 | 30163 | 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 | 30164 |
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 | 30165 | /* ??????????
* ?????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 | 30166 | /*
*???: 1.cpp
*??????
*????: 2012-10-19
*??: ???????????n?n???????????????a??????
*/
int main ()
{
int n = 0, iNum = 0;
int a[20] = {1,1};
for (int i = 2; i < 20; i++)
{
a[i] = a[i-1] + a[i-2];
} //??????????
cin >> n;
int b[n];
for (int j = 1; j <= n; j++)
{
cin >> iNum;
b[j-1]= a[iNum-1];
} //??????
for (int k = 1;k <= n;k++)
{
cout << b[k-1] << endl;
} //??????
return 0;
} |
61 | 30167 | int main()
{
int n,i,m,j;
cin>>n;
for(i=1;i<=n;i++)
{
cin>>m;
int a=1,b=1;
if(m>2)
{
for(j=3;j<=m;j++)
{
a=a+b;
b=a-b;
}
cout<<a<<endl;
}
else
cout<<"1"<<endl;
}
return 0;
}
|
61 | 30168 | 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 | 30169 | 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 | 30170 |
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 | 30171 | 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 | 30172 | 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 | 30173 | 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 | 30174 | 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 | 30175 |
int main() {
int a,n,i=1,j=2,o=1,p=1,q=1; //???a???q
cin>>n;
while (i<=n){
cin>>a;
while(j<a){
q=o+p;
o=p;
p=q;
j=j+1; //????q
}
cout<<q<<endl; //??q
i=i+1;
j=2;
o=1;
p=1;
q=1; //??
}
return 0;
}
|
61 | 30176 | 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 | 30177 | 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 | 30178 |
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 | 30179 | 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 | 30180 | 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 | 30181 |
int main()
{
int *arr;
int n,i,k;
int a;
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%d",&a);
arr=(int*)malloc(sizeof(int)*a);
for(k=0;k<a;k++)
{
if(k==0||k==1)
arr[k]=1;
else
arr[k]=arr[k-1]+arr[k-2];
}
printf("\n%d\n",arr[a-1]);
}
return 0;
} |
61 | 30182 |
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 | 30183 | 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 | 30184 | void compute(int shuzu);
int main()
{
int n,i,k,sum=0,a,b;
scanf("%d",&n);
int *shuzu=(int*)malloc(sizeof(int)*n);
for(i=0;i<n;i++)
{
scanf("%d",&shuzu[i]);
}
for(i=0;i<n;i++)
{
if(shuzu[i]<=2)
{
printf("1\n");
}else{
a=1;
b=1;
for(k=3;k<=shuzu[i];k++)
{
sum=a+b;
a=b;
b=sum;
}
printf("%d\n",sum);
}
}
free(shuzu);
return 0;
} |
61 | 30185 | 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 | 30186 | 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 | 30187 | 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 | 30188 | 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 | 30189 |
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 | 30190 | 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 | 30191 | int main()
{
int a[20];
a[1]=a[2]=1;
int i;
for(i=3;i<=20;i++)
{
a[i]=a[i-1]+a[i-2];
}
int n;
cin>>n;
int b[n];
for(i=1;i<=n;i++)
{
cin>>b[i];
}
for(i=1;i<=n;i++)
{
cout<<a[b[i]]<<endl;
}
}
|
61 | 30192 | 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 | 30193 | int main(){
int i,j;
int r;
scanf("%d",&r);
int n;
for(j=0;j<r;j++){
scanf("%d",&n);
int sz[10000];
sz[0]=0;
sz[1]=1;
if(n==1){
printf("1\n");
}
if(n>=2){
for(i=2;i<=n;i++){
sz[i]=sz[i-1]+sz[i-2];
}
printf("%d\n",sz[n]);
for(i=2;i<=n;i++){
sz[i]=0;
}
}
}
return 0;
} |
61 | 30194 | 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 | 30195 | 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 | 30196 | 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 | 30197 | 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 | 30198 |
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 | 30199 |
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;
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.