Cod sursa(job #949543)
| Utilizator | Data | 14 mai 2013 09:21:20 | |
|---|---|---|---|
| Problema | Al k-lea termen Fibonacci | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.4 kb |
#include <fstream>
#define nmax 100000000
using namespace std;
ifstream f("kfib.in"); ofstream g("kfib.out");
unsigned long long fib[nmax];
long long n;
void solve ()
{
fib[1]=1;
fib[2]=1;
for (int i=3; i<=n; i++)
{
fib[i]=fib[i-2]+fib[i-1];
}
g<<fib[n]%666013;
}
int main ()
{
f>>n;
solve();
f.close();g.close();
return 0;
}
