Pagini recente » Cod sursa (job #2875863) | Cod sursa (job #485509) | Istoria paginii runda/eusebiu_oji_2011_cls9 | Cod sursa (job #1769629) | Cod sursa (job #1661982)
#include <iostream>
#include <fstream>
#include <cstring>
using namespace std;
ifstream in("nunta.in");
ofstream out("nunta.out");
const int length = 210;
char a[length];
char b[length];
int na, nb;
int N;
void suma()
{
int i, aux, t = 0;
for(i = 1; i <= na || i <= nb || t != 0; i++)
{
aux = (a[i] - '0') + (b[i] - '0') + t;
a[i] = b[i];
b[i] = (char)('0' + aux % 10);
t = aux / 10;
}
na = nb;
nb = i - 1;
}
int main()
{
int i;
in >> N;
for(i = 0; i <= length; i++) a[i] = b[i] = '0';
na = nb = 1;
a[1] = '1';
b[1] = '2';
for(i = 3; i <= N; i++) suma();
for(i = nb; i >= 1; i--) out << b[i];
return 0;
}