Pagini recente » Cod sursa (job #1108559) | Cod sursa (job #2394955) | Cod sursa (job #2946784) | Cod sursa (job #1726732) | Cod sursa (job #1065458)
#include <fstream>
#define P 1999999973
using namespace std;
ifstream f("lgput.in");
ofstream g("lgput.out");
long long N,K;
long long Putere(int N,int K)
{
//poi intai prevad cazul K=0
if(K==0)return 1;
long long M=1;
while (K!=1)
if(K % 2==0)
{
N=(N*N) % P;
K/=2;
}
else
{
M=(M*N) % P;
--K;
}
return (M*N) % P;
}
int main()
{
f>>N>>K;
g<<Putere(N,K)<<'\n';
f.close();g.close();
return 0;
}