Cod sursa(job #1126090)
Utilizator | Data | 26 februarie 2014 21:14:53 | |
---|---|---|---|
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;fib[1]=1;fib[2]=1;
for(i=3;i<=n;++i){
fib[i]=fib[i-1]+fib[i-2];
return fib[n];
}
int main()
{f>>k;
g<<fi(k) % 666013;
return 0;
}