Pagini recente » Cod sursa (job #2174443) | Diferente pentru blog/romanii-la-disneyworld-partea-a-treia intre reviziile 18 si 19 | Cod sursa (job #2002072) | Monitorul de evaluare | Cod sursa (job #2021887)
#include <cstdio>
using namespace std;
//int n,i,k,t,y,nr;
char a[210],b[210];
//ifstream fin ("nunta.in");
//ofstream fout ("nunta.out");
FILE *fin = fopen ("nunta.in","r");
FILE *fout = fopen ("nunta.out","w");
int main (){
//fin>>n;
int n,y;
short t,nr;
fscanf (fin,"%i",&n);
if (n == 1){
fprintf (fout,"%i",1);
return 0;
}
// fibonacci
a[1] = b[1] = 1;
y = 1;
for (int k=1;k<n;k++){
t = 0;
for (int i=1;i<=y;i++){
nr = b[i];
b[i] += a[i]+t;
if (b[i] >= 10){
t = 1;
b[i] -= 10;
}
else
t = 0;
a[i] = nr;
}
if (t != 0)
b[++y] = t;
//for (i=1;i<=y;i++)
// a[i] = b[i];
}
for (int i=y;i>=1;i--)
fprintf (fout,"%c",b[i]+'0');
//fout<<(int)b[i];
// fin.close();
// fout.close();
return 0;
}