Cod sursa(job #1126072)
Utilizator | Data | 26 februarie 2014 21:08:57 | |
---|---|---|---|
Problema | Al k-lea termen Fibonacci | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <iostream>
#include <fstream>
#define MAXn 100000;
using namespace std;ifstream f("kfib.in");
ofstream g("kfib.out");
int fib[100000000];
unsigned k,n,i;
int fi(unsigned n){
float f;
for(i=1;i<=n;++i){
if(n<=2) f=1;
else f=fib[n-1]+fib[n-2];
fib[n]=f;}
return f;
}
int main()
{f>>k;
g<<fi(k)% 666013;
return 0;
}