Cod sursa(job #2454898)
Utilizator | Data | 10 septembrie 2019 10:13:15 | |
---|---|---|---|
Problema | Al k-lea termen Fibonacci | Scor | 30 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <fstream>
using namespace std;
ifstream in("kfib.in");
ofstream out("kfib.out");
const int MOD=666013;
int fib[1500000];
int main()
{
int n,x=2;
in>>n;
n++;
fib[1]=0;
fib[2]=1;
while(fib[x]%MOD)
{
fib[x+1]=fib[x]+fib[x-1];
if(fib[x+1]>MOD)
fib[x+1]-=MOD;
x++;
}
x--;
out<<fib[n%x];
return 0;
}