Pagini recente » Cod sursa (job #128860) | Cod sursa (job #304979) | Istoria paginii runda/oni_2019_11-12_ziua2 | Cod sursa (job #1597549) | Cod sursa (job #2023768)
#include <stdio.h>
char F[2][200];
int main(){
FILE*fi,*fo;
fi=fopen("nunta.in","r");
fo=fopen("nunta.out","w");
short n;
fscanf(fi,"%hd", &n);
if(n == 1){
fprintf(fo,"1");
return 0;
}
F[0][1] = 1;
F[1][1] = 2;
bool ind = 1;
unsigned char i, t;
short j;
for(j = 3; j <= n; j++){
t = 0;
for(i = 1; i <= 199 || t; i++, t/=10)
F[1 - ind][i] = (t += F[0][i] + F[1][i]) % 10;
ind = !ind;
}
i = 199;
while(F[ind][i] == 0) i--;
while(i > 0)
fprintf(fo,"%d", F[ind][i--]);
return 0;
}