Pagini recente » Cod sursa (job #1733728) | Cod sursa (job #53846) | Cod sursa (job #2192124) | Cod sursa (job #1704729) | Cod sursa (job #2022592)
#include <fstream>
using namespace std;
ifstream fin("nunta.in");
ofstream fout("nunta.out");
short n,i,nrcif;
char a[209],b[209];
void adun(char A[], char B[])
{
short t = 0;
short aux = 0;
for (short i=0; i<=nrcif; i++)
{
aux = B[i];
B[i] += A[i]+t;
if (B[i] >= 10)
{
t = 1;
B[i] -= 10;
}
else
t = 0;
A[i] = aux;
}
if (t != 0)
B[++nrcif] = t;
}
int main()
{
fin >> n;
if (n == 1)
{
fout << 1;
return 0;
}
a[0] = b[0] = 1;
for (i=1; i<=n-1; i++)
adun(a, b);
for (i=nrcif; i>=0; i--)
fout << (int)b[i];
return 0;
}