Pagini recente » Cod sursa (job #2285592) | Cod sursa (job #594034) | Cod sursa (job #1668086) | Cod sursa (job #319731) | Cod sursa (job #1483384)
#include <fstream>
#include <cstring>
using namespace std;
ifstream fin("nunta.in");
ofstream fout("nunta.out");
const int NMax = 200;
int n;
int A[NMax], B[NMax], C[NMax];
inline void sum(){
int i, t = 0;
for(i = 1; i <= A[0] || i <= B[0] || t; i++){
t += A[i] + B[i];
C[i] = t % 10;
t /= 10;
}
C[0] = i - 1;
}
int main(){
fin >> n;
if(n == 1){
fout << 1;
} else {
A[0] = B[0] = A[1] = B[1] = 1;
for(int i = 1; i < n; i++){
sum();
memcpy(A, B, sizeof(B));
memcpy(B, C, sizeof(C));
}
for(int i = C[0]; i > 0; i--){
fout << C[i];
}
}
return 0;
}