Cod sursa(job #1634449)
Utilizator | Data | 6 martie 2016 13:56:06 | |
---|---|---|---|
Problema | Al k-lea termen Fibonacci | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <stdio.h>
#define mod 1999999973
long long p(long long x,long long n)
{
long a=1;
while(n!=0)
{
if(n%2==1)
a=(a*x)%mod;
x=(x*x)%mod;
n/=2;
}
return a%mod;
}
long long x,n;
int main()
{
FILE*f1,*f2;
f1=fopen("lgput.in","r");
f2=fopen("lgput.out","w");
fscanf(f1,"%ld%ld",&x,&n);
fprintf(f2,"%ld",p(x,n));
return 0;
}