Pagini recente » Cod sursa (job #1481104) | Cod sursa (job #2592089) | Cod sursa (job #1400957) | Cod sursa (job #2590367) | Cod sursa (job #2433219)
#include <iostream>
#include <fstream>
using namespace std;
const int MAXN = 215,
BAZA = 10;
int N;
unsigned char F1[MAXN] = {1, 1}, F2[MAXN] = {1, 2};
unsigned char *M1 = F1, *M2 = F2, *AX;
ifstream f("nunta.in");
ofstream g("nunta.out");
void sum(unsigned char A[], unsigned char B[])
{
int T = 0;
if(A[0] < B[0])
A[0] = B[0];
for(int i = 1; i <= A[0]; i++)
{
T += A[i] + B[i];
A[i] = T % BAZA;
T /= BAZA;
}
if(T > 0)
A[++A[0]] = 1;
}
int main()
{
int n;
f >> n;
if(n <= 2)
M2[1] = n;
else
for(int i = 3; i <= n; i++)
{
sum(M1, M2);
AX = M1;
M1 = M2;
M2 = AX;
}
for(int i = M2[0]; i >= 1; i--)
g << (int)M2[i];
return 0;
}