Cod sursa(job #2262543)
Utilizator | Data | 17 octombrie 2018 16:31:29 | |
---|---|---|---|
Problema | Al k-lea termen Fibonacci | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <iostream>
#include <fstream>
#define mod 1999999973
using namespace std;
ifstream f("lgput.in");
ofstream g("lgput.out");
unsigned long long int n,p;
unsigned long long int logp(long long int b,long long int exp)
{
if(exp==1)
return b%mod;
if(exp%2==1)
return (b*logp(b,exp-1))%mod;
else
return logp((b*b)%mod,exp/2);
}
int main()
{
f>>n>>p;
cout<<logp(n,p);
g<<logp(n,p);
return 0;
}