Pagini recente » Cod sursa (job #373479) | Cod sursa (job #182878) | Cod sursa (job #2969203) | Cod sursa (job #2703244) | Cod sursa (job #1916355)
#include <iostream>
#include <cstdio>
using namespace std;
#define DIM 230
char f2[DIM], f3[DIM];
int x;
char N;
int main() {
freopen("nunta.in","r",stdin);
freopen("nunta.out","w",stdout);
scanf("%d\n", &x);
N = x;
if(N < 4) {
printf("%d\n", x);
return 0;
}
f2[0] = 1, f2[1] = 2;
f3[0] = 1, f3[1] = 3;
bool x = true;
for(char i = 4; i <= N; ++i) {
if(x == true) {
char j = 1;
char cat = 0;
while(j <= f2[0] || j <= f3[0] || cat) {
f2[j] = (int)f2[j] + (int)f3[j] + (int)cat;
cat = char((int)f2[j] / (int)10);
f2[j] %= (int)10;
f2[0] = (char)max((int)f2[0], (int)j);
j = (char)(j + 1);
}
x = false;
}
else {
char j = 1;
char cat = 0;
while(j <= f2[0] || j <= f3[0] || cat) {
f3[j] = (int)f2[j] + (int)f3[j] + (int)cat;
cat = char((int)f3[j] / (int)10);
f3[j] %= (int)10;
f3[0] = max((int)f3[0], (int)j);
j++;
}
x = true;
}
}
if(x == true) {
for(char i = (int)f3[0]; i > 0; --i) {
printf("%d", (int)f3[(int)i]);
}
printf("\n");
}
else {
for(char i = (int)f2[0]; i > 0; --i) {
printf("%d", (int)f2[(int)i]);
}
printf("\n");
}
return 0;
}