Pagini recente » Cod sursa (job #2418546) | Cod sursa (job #1566135) | Cod sursa (job #2087285) | Cod sursa (job #1799389) | Cod sursa (job #2178064)
#include <iostream>
#include <fstream>
using namespace std;
///aici aplic RIDICAREA LA PUTERE IN TIMP LOGARITMIC;
ifstream fin("lgput.in");
ofstream fout("lgput.out");
const int MOD=1999999973;
int ridicare_la_putere_logaritmic(int n,int k)
{
int r=1;
while(k)
{
if( k & 1)///if(k%2==1)
r=(1LL * r * n) % MOD;
n=(1LL* n * n) % MOD;
k>>=1;///k/=2;
}
return r;
}
///SAU
int ridicare1_la_putere_logaritmic(int n,int k)
{
int r=1;
for(long long i=1; i<=k; i<<=1)
{
if(k&i)
r=(1LL*r*n)%MOD;
n=(1LL*n*n)%MOD;
}
return r;
}
int n, k;
int main()
{
fin>>n>>k;
fout<<ridicare1_la_putere_logaritmic(n,k);
return 0;
}