Pagini recente » Cod sursa (job #3234324) | Cod sursa (job #2946149) | Cod sursa (job #485808) | Cod sursa (job #622465) | Cod sursa (job #878026)
Cod sursa(job #878026)
#include<fstream>
using namespace std;
ifstream f("nunta.in");
ofstream g("nunta.out");
int f1[500],f2[500],a[500],i,j,p,t,n;
int main()
{ f>>n;
f1[0]=1;
f1[1]=1;
f2[0]=1;
f2[1]=2;
if(n==1){ g<<f1[1]<<'\n';
return 0;
}
if(n==2) { g<<f2[1]<<'\n';
return 0;
}
j=1;
while(j<=n-2)
{ t=0;
i=1;
p=0;
while(i<=f1[0]||i<=f2[0]||t)
{ t=t+f1[i]+f2[i];
a[i]=t%10;
t/=10;
i++;
p++;
}
a[0]=p;
j++;
for(i=0;i<=f2[0];++i) f1[i]=f2[i];
for(i=0;i<=a[0];++i) f2[i]=a[i];
}
for(i=f2[0];i>0;i--) g<<f2[i];
g<<'\n';
f.close();
g.close();
return 0;
}