Pagini recente » Cod sursa (job #1047594) | Cod sursa (job #2098353) | Cod sursa (job #1582576) | Cod sursa (job #3338715) | Cod sursa (job #3330077)
#include <fstream>
#include <iostream>
using namespace std;
ifstream f("nunta.in");
ofstream g("nunta.out");
int main()
{
int N;
cin>>N;
int a[3000], b[3000], c[3000],
la=1 , lb=1 , lc;
a[0]=1;
b[0]=1;
if (N == 1)
{
cout<<1;
return 0;
}
for (int step=3 ; step<=N+1 ; step++)
{
lc=0;
int k=0 , L=max(la, lb);
for (int i=0 ; i<L || k ; i++)
{
int sum=k;
if (i < la)
sum+=a[i];
if (i < lb)
sum+=b[i];
c[lc++]=sum%10;
k=sum/10;
}
la=lb;
for(int i=0 ; i<la ; i++)
a[i]=b[i];
lb=lc;
for(int i=0 ; i<lb ; i++)
b[i]=c[i];
}
for(int i=lb-1 ; i>=0 ; i--)
cout<<b[i];
f.close();
g.close();
return 0;
}