Pagini recente » Cod sursa (job #894264) | Cod sursa (job #1178023) | Cod sursa (job #1127385) | Cod sursa (job #1603554) | Cod sursa (job #878956)
Cod sursa(job #878956)
#include<fstream >
using namespace std;
ifstream f("nunta.in");
ofstream g("nunta.out");
int a[500],b[500],c[500],t,i,p,k,n;
int main()
{ f>>n;
a[1]=1;
b[1]=2;
a[0]=1;
b[0]=1;
if(n==1) { g<<"1"<<'\n';
return 0;
}
if(n==2) { g<<2<<'\n';
return 0;
}
for(k=1;k<=n-2;k++)
{ i=1;
t=0;
p=0;
while(i<=a[0]||i<=b[0]||t>0)
{ t=t+a[i]+b[i];
c[i]=t%10;
t=t/10;
p++;
i++;
}
c[0]=p;
for(i=0;i<=b[0];++i) a[i]=b[i];
for(i=0;i<=c[0];++i) b[i]=c[i];
}
for(i=b[0];i>0;i--) g<<b[i];
g<<'\n';
f.close();
g.close();
return 0;
}