Cod sursa(job #1916197)
| Utilizator | Data | 9 martie 2017 08:27:42 | |
|---|---|---|---|
| Problema | Al k-lea termen Fibonacci | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.5 kb |
#include <bits/stdc++.h>
#define MOD 666013
using namespace std;
int n;
int a[1332030];
int main()
{
int k;
a[1]=1;
a[2]=1;
a[3]=2;
n=3;
bool gata=false;
while(!gata)
{
n++;
a[n]=(a[n-1] + a[n-2])%MOD;
if(a[n]==1 && a[n-1]==1)
gata=true;
}
n-=2;
ifstream fin("kfib.in");
ofstream fout("kfib.out");
fin>>k;
k%=n;
fout<<a[k]<<"\n";
fin.close();
fout.close();
return 0;
}
