Cod sursa(job #1586697)
Utilizator | Data | 1 februarie 2016 16:35:17 | |
---|---|---|---|
Problema | Al k-lea termen Fibonacci | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include <fstream>
#define mod 666013
#define MAXN 2*mod+10
using namespace std;
ifstream f("kfib.in");
ofstream g("kfib.out");
int n,F[MAXN],i,w=1;
const int p=2*mod+2;
int main() {
f>>n;
int k=n%p;
F[1] = F[2] = 1;
for (i=3;i<=k;i++) F[i] = (F[i - 1] + F[i - 2]) % mod;
g<<F[k];
g.close(); return 0;
}