Pagini recente » Cod sursa (job #938257) | Cod sursa (job #2672148) | Cod sursa (job #1560264) | Cod sursa (job #1536488) | Cod sursa (job #2062845)
#include <iostream>
#include <fstream>
#define maxim 999
using namespace std;
int a[maxim],b[maxim],c[maxim];
void fib(){
int i,ordin;
for(i=0;i<maxim;i++)c[i]=a[i]+b[i];
for(i=maxim-1;i>0;i--){
if(c[i]>9){
ordin=c[i];
c[i]%=10;
c[i-1]+=(ordin/10);
}
}
}
int main()
{
ifstream f("nunta.in");
ofstream g("nunta.out");
int N,x=0,i,j;
for(i=0;i<maxim;i++)a[i]=b[i]=c[i]=0;
a[maxim-1]=1;b[maxim-1]=2;
f>>N;
if(N<=2)g<<N;
else{
for(i=0;i<N;i++){
fib();
if(i==N-3)break;
for(j=0;j<maxim;j++)a[j]=b[j];
for(j=0;j<maxim;j++)b[j]=c[j];
}
for(i=0;i<maxim;i++){
if(x||c[i]){
x=1;
g<<c[i];
}
}
}
f.close();
g.close();
return 0;
}