Cod sursa(job #685631)
Utilizator | Data | 21 februarie 2012 08:09:39 | |
---|---|---|---|
Problema | Al k-lea termen Fibonacci | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include<fstream>
using namespace std;
long long F[100000000];
void fib(long long k)
{
long long i;
for(i=3;i<=k;i++)
F[i]=F[i-1]+F[i-2];
}
int main()
{
long long n;
fstream f("kfib.in",ios::in);
fstream g("kfib.out",ios::out);
f>>n;
F[1]=1;
F[2]=1;
fib(n);
g<<F[n];
f.close();
g.close();
return 0;
}