Pagini recente » Cod sursa (job #1687923) | Cod sursa (job #1258252) | Cod sursa (job #2785566) | Cod sursa (job #1821769) | Cod sursa (job #1981454)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("nunta.in");
ofstream out("nunta.out");
const int maxn = 105;
void add(char A[], char B[])
{
int i = 1;
int tr = 0;
for(i = 1; i <= A[0] || tr > 0; i++)
{
A[i] = (tr += A[i] + B[i]) % 10;
tr = tr / 10;
}
A[0] = i - 1;
}
void cop(char A[], char B[]) /// pune A in B
{
for(int i = 0; i <= A[0]; i++)
B[i] = A[i];
}
char A[maxn];
char B[maxn];
char aux[maxn];
int main()
{
int n;
in >> n;
A[0] = 1;
A[1] = 1;
B[0] = 1;
B[1] = 1;
n++;
for(int i = 3; i <= n; i++)
{
cop(A, aux);
add(A, B);
cop(B, aux);
}
for(int i = A[0]; i >= 1; i--)
out << (int)A[i] << " ";
out << "\n";
return 0;
}