label
stringlengths 1
2
| index
stringlengths 1
5
| code
stringlengths 87
8.24k
|
|---|---|---|
61 | 30000 | int main()
{
int n,a,i,a1,a2,t,l,m;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d",&a);
a1=1;a2=1;
if(a==1)
l=a1;
else {
if(a==2)
l=a2;
else {
l=2;
for(t=1;t<a-2;t++){
m=a2;
a2=l;
l+=m;
}
}
}
printf("%d\n",l);
}
return 0;
}
|
61 | 30001 | main(){
int n,i,a[100],b[100];
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d",&a[i]);
}
int s=2;
b[0]=1;
b[1]=1;
for(i=0;i<n;i++){
if(a[i]<=2)
printf("1\n");
else{
for(s=2;s<a[i];s++){
int j=s-1;
int k=s-2;
b[s]=b[j]+b[k];
}
int m=a[i]-1;
printf("%d\n",b[m]);
}
}
} |
61 | 30002 | int main(){
int k,n,s=0;
int a=1,b=1;
scanf("%d",&k);
for(int q=1;q<=k;q++){
scanf("%d",&n);
if(n==1||n==2){
s=1;
}
else{
for(int w=1;w<n-1;w++){
s=a+b;
a=b;
b=s;
}
}
printf("%d\n",s);
s=0;
a=1;
b=1;
}
return 0;
}
|
61 | 30003 | int main()
{
int x[21], i, n, y[100];
x[1] = 1;
x[2] = 1;
for(i = 3; i < 21; i++)
{
x[i] = x[i - 1] + x[i - 2];
}
cin >> n;
for(i = 0; i < n; i++)
{
cin >> y[i];
}
for(i = 0; i < n; i++)
{
cout << x[y[i]] << endl;
}
return 0;
} |
61 | 30004 | 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 k=0;
int a[k];
cin>>k;
for(int i=0;i<k;i++)
{
cin>>a[i];
}
for(int i=0;i<k;i++)
{
cout<<f(a[i])<<endl;
}
return 0;
} |
61 | 30005 | int main()
{
int i,n,t,a[21],j;
a[2]=a[1]=1;
cin >> t;
for(i=1;i<=t;i++)
{
cin >> n ;
if(n<=2)
{
cout << 1 << endl;
continue;
}
else
{
for(j=3;j<=n;j++)
a[j] = a[j-1] + a[j-2] ;
}
cout << a[n] << endl ;
}
return 0;
} |
61 | 30006 | 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 | 30007 |
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 | 30008 | 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 | 30009 | 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 | 30010 | 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 | 30011 | main() { int f[20],a[20],i,j,n;
scanf("%d",&n);
f[1]=1; f[2]=1;
for(i=2;i<=20;i++)
f[i+1]=f[i]+f[i-1];
for(i=1;i<=n;i++)
{ scanf("%d",&a[i]);
printf("\n"); }
for(j=1;j<=n;j++)
{ printf("%d",f[a[j]]);
printf("\n"); }
}
|
61 | 30012 | int main(){
int n,a,x,y,e;
int i=0,j=0;
int s[21];
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d",&a);
if(a==1||a==2){
y=1;
}
else{
j=0;
for(j=0;j<a-1;j++){
if(j==0){
y=1;
x=1;
}
if(j>0){
e=y;
y=x+y;
x=e;
}
}
}
s[i]=y;
}
i=0;
for(i=0;i<n;i++){
printf("%d\n",s[i]);
}
return 0;
}
|
61 | 30013 | 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 | 30014 | 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 | 30015 | 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 | 30016 | long f(int x);
int main()
{
int num,n[10],r;
cin >> num;
for(r=0;r<num;r++) cin >> n[r];
for(r=0;r<num;r++) cout << f(n[r]) << '\n';
return 0;
}
long f(int x)
{
if(x==1||x==2) return 1;
else return f(x-1)+f(x-2);
} |
61 | 30017 | //??????
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 | 30018 | 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 | 30019 | int main(){
int n,i,c;
int a[1000];
int b[1000];
int g[1000];
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d",&a[i]);
}
b[0]=1;
b[1]=1;
for(i=2;i<1000;i++){
b[i]=b[i-1]+b[i-2];
}
for(i=0;i<n;i++){
c=a[i]-1;
g[i]=b[c];
}
for(i=0;i<n;i++){
printf("%d\n",g[i]);
}
return 0;
} |
61 | 30020 | 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 | 30021 | int F(int x){
int sz[100];
int i;
sz[0]=1;
sz[1]=1;
for(i=2;i<100;i++){
sz[i]=sz[i-1]+sz[i-2];
}
return sz[x-1];
}
int main(){
int n;
int i;
int sa[100];
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d",&sa[i]);
printf("%d\n",F(sa[i]));
}
return 0;
}
|
61 | 30022 | int febonaqi(int a){
if(a==1) return 1;
else if(a==2) return 1;
else return febonaqi(a-1)+febonaqi(a-2);
}
int main(){
int n;
cin>>n;
while(n>0){
int s;
cin>>s;
cout<<febonaqi(s)<<endl;
n--;
}
return 0;
} |
61 | 30023 | 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 | 30024 |
int main()
{
int i,a,n,t;
int f[25]={1,1};
int b[20];
scanf("%d",&n);
for(i=2;i<25;i++)
f[i]=f[i-2]+f[i-1];
for(i=0;i<n;i++){
scanf("%d",&a);
b[i]=a-1;}
for(i=0;i<n;i++)
{
t=b[i];
printf("%d\n",f[t]);}
}
|
61 | 30025 | //
// 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 | 30026 | int main()
{
int i,n,a,j,s;
int b[100];
scanf("%d",&n);
int c[200];
for(i=0;i<n;i++)
{scanf("%d",&c[i]);}
for(i=0;i<n;i++)
{
for(j=0;j<c[i];j++)
{b[0]=1;
b[1]=1;
if(c[i]==1)
{s=b[0];}
if(c[i]==2)
{s=b[1];}
if(c[i]>=3)
{
b[j+2]=b[j]+b[j+1];
s=b[c[i]-1];
}
}
printf("%d\n",s);
}
}
|
61 | 30027 | int a[22]={0,1,1};
int fibo(int n){
if(n==1||n==2)return 1;
else if(a[n]==0)a[n]=fibo(n-1)+fibo(n-2);
return a[n];
}
void main()
{
int n,cases;
scanf("%d",&cases);
while(cases--){
scanf("%d",&n);
printf("%d\n",fibo(n));
}
} |
61 | 30028 | 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 | 30029 | 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 | 30030 | 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 | 30031 | int main(){
int n,x,j,l,k;
int i=1;
int a[10000];
scanf("%d",&n);
while(i<=n)
{
scanf("%d",&x);
a[0]=1;
a[1]=1;
if(x==1||x==2)
printf("1");
else
{
j=2;
while(j<x)
{
a[j]=a[j-1]+a[j-2];
j++;
}
printf("%d\n",a[j-1]);
}
i++;
}
return 0;
} |
61 | 30032 |
int main()
{
int i,n,a,b;
int N[20];
scanf("%d",&n);
for(a=0;a<=n-1;a++)
scanf("%d",&N[a]);
int f[20]={1,1};
for(i=2;i<20;i++)
{
f[i]=f[i-2]+f[i-1];
}
for(a=0;a<=n-1;a++)
{
b=N[a]-1;
printf("%d\n",f[b]);
}
return 0;
}
|
61 | 30033 | /*
* ??????????.cpp
* ??????
* ?????2012.10.23
* ?????????
*/
int main()
{
int n,a,b,i,s,p;
cin>>s;
for (p=1;p<=s;p++)
{
cin>>n;
a=b=1;
i=2;
if (n<=2)
cout<<a<<endl;
else
{
while (i<=n)
{
a=a+b;
i++;
if (i==n)
{cout<<a<<endl;break;}
else
{
b=a+b;
i++;
if (i==n)
{cout<<b<<endl;break;}
}
}
}
}
return 0;
}
|
61 | 30034 | 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 | 30035 | 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 | 30036 | void xun(int);
int main()
{
int n, a, i;
cin >> n;
for(i = 0; i < n; i++)
{
cin >> a;
xun(a);
}
return 0;
}
void xun(int a)
{
int i, b = 1, c = 1, d;
if(a == 1 || a == 2)
cout << "1" << endl;
else
{
a --;
for(i = 1; i < a; i++)
{
d = b;
b = b + c;
c = d;
}
cout << b << endl;
}
return ;
} |
61 | 30037 | int feibo(int n);
int main()
{
int i,n,c,result[1000];
scanf("%d",&c);
for(i=1;i<=c;i++){
scanf("%d",&n);
result[i]=feibo(n);
}
for(i=1;i<=c;i++){
printf("%d\n",result[i]);
}
return 0;
}
int feibo(int n)
{
int a=0;
int b=0;
int result=1;
int i;
for(i=1;i<=n-1;i++){
a=result;
result=result+b;
b=a;
}
return result;
} |
61 | 30038 |
int main()
{
int i=0,j=0,n;
int a[10000]={0},b[100]={0};
b[0]=1;b[1]=1;
cin >> n;
for(i=0;i<n;i++)
{cin >> a[i];}
for(j=2;j<22;j++)
{b[j]=b[j-1]+b[j-2];}
for(i=0;i<n;i++)
cout << b[a[i]-1] << endl;
return 0;
}
|
61 | 30039 | int main()
{
int f(int n);
int n,a[10],i;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&a[i]);
for(i=0;i<n;i++)
printf("%d\n",f(a[i]));
return 0;
}
int f(int n)
{
int b;
if(n==1||n==2)
b=1;
else
b=f(n-1)+f(n-2);
return(b);
}
|
61 | 30040 | int feibonaqishulie(int a)
{
int b,a1,a2,i;
a1=a2=1;
if(a==1|a==2) b=1;
else
for(i=2;i<a;i++)
{
b=a1+a2;
a1=a2;
a2=b;
}
return(b);
}
int main()
{
int n,a;
cin>>n;
for(int i=0;i<n;i++)
{
cin>>a;
cout<<feibonaqishulie(a)<<endl;
}
return 0;
} |
61 | 30041 | 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 | 30042 |
int main()
{
int n,a,i,j,x=1,y=1,z=0;
int b[100];
scanf("%d",&n);
for(i=0;i<n;i++){
x=1;y=1;
scanf("%d",&a);
if(a==1||a==2){
b[i]=1;
}else{
for(j=0;j<a-2;j++){
z=x+y;
x=y;
y=z;
b[i]=z;
}
}
}for(i=0;i<n;i++){
printf("%d\n",b[i]);
}
return 0;
}
|
61 | 30043 | int main()
{
int a[21] = {0}, n, i, m;
cin >> n;
a[1] = 1;
a[2] = 1;
while(n--)
{
cin >> m;
if(m == 1 || m == 2)
cout << 1 << endl;
else
{
for(i = 3; i <= m; i++)
a[i] = a[i - 1] + a[i - 2];
cout << a[m] << endl;
}
}
return 0;
} |
61 | 30044 |
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 | 30045 | 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 | 30046 | 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 | 30047 | 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 | 30048 | int main(){
int n;
scanf("%d",&n);
int a[20];
int i,m;
for(i=0;i<n;i++){
scanf("%d",&a[i]);
}
int sz[20];
for(i=0;i<20;i++){
if(i==0){
sz[i]=1;
}else if(i==1){
sz[i]=1;
}else{
sz[i]=sz[i-1]+sz[i-2];
}
}
for(i=0;i<n;i++){
if(i==n-1){
m=a[i];
printf("%d",sz[m-1]);
m=0;
}else{
m=a[i];
printf("%d\n",sz[m-1]);
m=0;
}
}
return 0;
}
|
61 | 30049 |
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 | 30050 | 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 | 30051 | /*
* 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 | 30052 | 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 | 30053 |
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 | 30054 | 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 | 30055 | /*
* ??????.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 | 30056 | 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 | 30057 | 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 | 30058 | 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 | 30059 |
void main()
{
int n,i,a;
int num[20]={1,1};
for(i=2;i<20;i++)
{
num[i]=num[i-1]+num[i-2];
}
scanf("%d\n",&n);
for(i=1;i<=n;i++)
{
scanf("%d",&a);
printf("%d\n",num[a-1]);
}
} |
61 | 30060 | 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 | 30061 | 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 | 30062 | int F(int n);
int main(){
int n,z,i,sz[1000],result;
scanf("%d",&z);
for(i=0;i<z;i++){
scanf("%d",&(sz[i]));
}
for(i=0;i<z;i++){
n=sz[i];
result=F(n);
printf("%d\n",result);
}
return 0;
}
int F(int n){
scanf("%d",&n);
if(n==1){return 1;}
if(n==2){return 1;}
else{return F(n-1)+F(n-2);}
}
|
61 | 30063 | int main(){
int n,i,j;
int an[20];
int fb(int a);
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d",&an[i]);
}
for (j=1;j<=n;j++){
if (an[j-1]==1||an[j-1]==2){
printf("1\n");
}
else {
printf("%d\n",fb(an[j-1]));
}
}
return 0;
}
int fb(int a){
int n1=1,n2=1,m,t;
for (t=3;t<=a;t++){
m=n1+n2;
n1=n2;
n2=m;
}
return m;
} |
61 | 30064 | 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 | 30065 |
int main()
{
int n,i,j;
int ph[20] = {1, 1};
int a[20];
for (i=2; i<20; i++)
ph[i] = ph[i-2] + ph[i-1];
scanf("%d\n", &n);
for (j = 0; j < n; j++)
scanf("%d", &a[j]);
for (j = 0; j < n; j++)
printf("%d\n", ph[a[j]-1]);
return 0;
} |
61 | 30066 | 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 | 30067 |
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 | 30068 |
int fab(int);
int main()
{
int n,a,i;
cin >> n;
for(i=0;i<n;i++)
{
cin >> a;
cout << fab(a) << endl;
}
return 0;
}
int fab(int a)
{
if(a==1)return 1;
else if(a==2)return 1;
else
return fab(a-1)+fab(a-2);
} |
61 | 30069 |
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 | 30070 | 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 | 30071 | int sum(int m);
int main()
{
int m,n,i,a[100];
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%d",&m);
printf("%d\n",sum(m));
}
}
int sum(int m)
{
int i,a[100];
for(i=3;i<=21;i++)
{
a[1]=1;a[2]=1;
a[i]=a[i-1]+a[i-2];
}
return a[m];
}
|
61 | 30072 | /*??
?????????????: ?????????????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 | 30073 | 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 | 30074 | 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 | 30075 | 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 | 30076 | /*
* 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 | 30077 | 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 | 30078 | int pb(int n);
int main(){
int i,a,n,k,s[1000];
scanf("%d",&k);
for(i=0;i<k;i++){
scanf("%d",&n);
s[i]=pb(n);
}
for(i=0;i<k;i++){
printf("%d\n",s[i]);
}
return 0;
}
int pb(int m){
int sz[100000];
sz[1]=1;sz[2]=1;
for(int i=3;i<=m;i++){
sz[i]=sz[i-1]+sz[i-2];
}
return sz[m];
} |
61 | 30079 | int main(){
int n;
scanf("%d",&n);
int a[30];
int b[30][100];
for(int i=0;i<=29;i++){
b[i][1]=1;
b[i][2]=1;}
for(int i=0;i<n;i++){
scanf("%d",&a[i]);
if((a[i]==1)||(a[i]==2)){
printf("%d\n",b[i][a[i]]=1);}
else{
for(int j=3;j<=a[i];j++){
b[i][j]=b[i][j-1]+b[i][j-2];
}
printf("%d\n",b[i][a[i]]); }
}
scanf("%d",&n);
return 0;}
|
61 | 30080 | int main()
{
int n,a[10000],b;
scanf("%d",&n);
int i;
for(i=1;i<=n;i++)
{
scanf("%d",&b);
a[1]=1;a[2]=1;
for(int j=3;j<=b;j++)
a[j]=a[j-1]+a[j-2];
printf("%d\n",a[b]);
}
getchar();
getchar();
getchar();
getchar();
}
|
61 | 30081 | main()
{
int n,i,a[10000],b[10000];
int cal(int x);
scanf("%d",&n);
for(i=1;i<=n;i++) {scanf("%d",&a[i]);}
for(i=1;i<=n;i++) {b[i]=cal(a[i]);}
printf("%d",b[1]);
for(i=2;i<=n;i++) {printf("\n%d",b[i]);}
}
int cal(int x)
{
int i,a[30],t;
a[1]=1;a[2]=1;
for(i=3;i<=30;i++) {a[i]=a[i-1]+a[i-2];}
t=a[x];
return(t);
} |
61 | 30082 | 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 | 30083 | int main()
{
int n,a;
scanf("%d",&n);
for (int i=0;i<n;i++)
{
scanf("%d",&a);
int b[a];
if (a==1||a==2) printf("1\n");
else
{
b[0]=1;
b[1]=1;
for (int j=2;j<a;j++)
b[j]=b[j-1]+b[j-2];
printf("%d\n",b[a-1]);
}
}
} |
61 | 30084 | int main(){
int f[20];
f[1]=1;
f[0]=1;
int n;
int a[20];
for(int i=2;i<=19;i++)
f[i]=f[i-1]+f[i-2];
cin>>n;
for(int i=0;i<=n-1;i++)
cin>>a[i];
for(int i=0;i<=n-1;i++)
cout<<f[a[i]-1]<<endl;//????1????
} |
61 | 30085 | 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 | 30086 | 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 | 30087 |
int main(){
int n,f[21]={1,1};
cin>>n;
for (int j=2;j<20;j++)
f[j]=f[j-1]+f[j-2];
for(int i = 0;i<n;i++){
int x;
cin>>x;
cout<<f[x-1]<<endl;
}
return 0;
} |
61 | 30088 | 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 | 30089 | int main()
{
int n, i, j, a[100], b[21] = {0, 1, 1};
cin>>n;
for (i = 0; i < n; i++)
{
cin>>a[i];
if (a[i] == 1 || a[i] == 2)
cout<<1<<endl;
else
{
for (j = 3; j <= a[i]; j++)
{
b[j] = b[j - 1] + b[j - 2];
}
cout<<b[j - 1]<<endl;
}
}
return 0;
}
|
61 | 30090 |
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 | 30091 | 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 | 30092 | 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 | 30093 | 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 | 30094 | 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 | 30095 | 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 | 30096 | int main()
{
int a[21],m,p;
a[0]=0;
a[1]=1;
for(int i=2;i<21;i++){
a[i]=a[i-1]+a[i-2];
}
int n;
scanf("%d",&n);
for(int j=0;j<n;j++){
scanf("%d",&p);
printf("%d\n",a[p]);
}
int hou;
scanf("%d",&hou);
return 0;
}
|
61 | 30097 | 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 | 30098 |
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 | 30099 | /*
*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;
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.