Cod sursa(job #2961395)
Utilizator | Data | 6 ianuarie 2023 14:05:41 | |
---|---|---|---|
Problema | Al k-lea termen Fibonacci | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("kfib.in");
ofstream out("kfib.out");
const int mod=666013;
int v[105];
int fib(int n)
{
if(v[n]!=0)
return v[n];
if(n<=1)
{
v[n]=n;
return n;
}
v[n]=(fib(n-1)%mod+fib(n-2)%mod)%mod;
return v[n];
}
int main()
{
int n;
in>>n;
out<<fib(n);
return 0;
}