Pagini recente » Cod sursa (job #1730947) | Cod sursa (job #2694568) | Cod sursa (job #934485) | Cod sursa (job #2076310) | Cod sursa (job #367480)
Cod sursa(job #367480)
#include<fstream>
using namespace std;
ifstream f("nunta.in");
ofstream g("nunta.out");
int main ()
{
long A[100000],B[100000],t,ok,n,i,x;
A[0]=1; A[1]=1;
B[0]=1; B[1]=1;
ok=2;
f>>n;
for (x=2; x<=n; x++)
{
if (ok==1) ok=2;
else if (ok==2) ok=1;
t=0;
if (ok==1)
for (i=1; i<=A[0] || i<=B[0] || t; i++, t/=10)
{
A[i] = (t += A[i] + B[i]) % 10;
if ((i>A[0] || i>B[0]) && t) A[0]++;
}
else if (ok==2)
for (i=1; i<=A[0] || i<=B[0] || t; i++, t/=10)
{
B[i] = (t += A[i] + B[i]) % 10;
if ((i>A[0] || i>B[0]) && t) B[0]++;
}
}
if (ok==1)
for (i=A[0]; i>=1; i--)
g<<A[i];
else if (ok==2)
for (i=B[0]; i>=1; i--)
g<<B[i];
return 0;
}