Pagini recente » Cod sursa (job #2950859) | Cod sursa (job #2029851) | Cod sursa (job #1468151) | Cod sursa (job #1657125) | Cod sursa (job #999482)
Cod sursa(job #999482)
#include<cstdio>
using namespace std;
short a[100],b[100],c[100];
int n;
void adun(short c[], short a[], short b[]){
int t=0;
for(int i=1; i<=c[0];++i) c[i]=0; c[0]=0;
for(int i=0;i<=a[0];++i) c[i]=a[i];
if(b[0]>c[0]){
for(int i=a[0]+1;i<=b[0];) c[i++]=0;
c[0]=b[0];
}
else for(int i=b[0]+1;i<=a[0];) b[i++]=0;
for(int i=1;i<=c[0];i++){
c[i]+=b[i]+t;
t=c[i]/10;
c[i]%=10;
}
if (t) c[++c[0]]=t;
}
void schimb(short a[], short b[]){
for(int i=0;i<=b[0];++i) a[i]=b[i];
}
int main(){
freopen("nunta.in","r",stdin); freopen("nunta.out","w",stdout);
scanf("%d", &n);
if(n==1) printf("1\n");
if(n==2) printf("2\n");
if(n==3) printf("3\n");
if(n==4) printf("5\n");
if(n>4){
a[0]=1; a[1]=1;
b[0]=1; b[1]=2;
for(int i=3;i<=n;++i){
adun(c,a,b); //c=a+b
schimb(a,b); //a=b;
schimb(b,c); //b=c
}
for(int i=c[0]; i>=1;--i) printf("%d", c[i]); printf("\n");
}
return 0;
}