Cod sursa(job #903649)
| Utilizator | Data | 2 martie 2013 00:11:29 | |
|---|---|---|---|
| Problema | Al k-lea termen Fibonacci | Scor | 20 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.46 kb |
#include <cstdio>
#define mod 666013
using namespace std;
FILE *f=fopen("kfib.in","r");
FILE *g=fopen("kfib.out","w");
int a,fib1,fib2,fib3;
int fib(int x)
{
int i;
fib1=1;
fib2=1;
if(x==1||x==2)
return 1;
else
for(i=3;i<=x;i++)
{
fib3=(fib1+fib2)%mod;
fib2=fib1;
fib1=fib3;
}
return fib3;
}
int main()
{
fscanf(f,"%d",&a);
fprintf(g,"%d",fib(a));
return 0;
}
