Pagini recente » Cod sursa (job #2119087) | Cod sursa (job #1417077) | Cod sursa (job #1124635) | Cod sursa (job #2225697) | Cod sursa (job #1581593)
#include <iostream>
#include <fstream>
using namespace std;
const int nmax = 10005;
int main()
{
ifstream fin("nunta.in");
ofstream fout("nunta.out");
ios_base::sync_with_stdio(false);
int a[2][nmax], i, t=0, n, j;
fin >> n;
a[0][0]=a[0][1]=a[1][0]=a[1][1]=1;
for(j=1; j<n; j++)
{
for(i=1; i<=a[0][0] || i<=a[1][0] || t; i++,t/=10)
a[j%2][i]=(t+=a[j%2][i]+a[(j+1)%2][i])%10;
a[j%2][0]=i-1;
}
for (i=a[(n-1)%2][0]; i; i--)
fout << a[(n-1)%2][i];
fin.close();
fout.close();
return 0;
}