Pagini recente » Istoria paginii runda/minune7/clasament | Cod sursa (job #1796727) | Diferente pentru preoni-2007/runda-4/solutii intre reviziile 34 si 32 | Istoria paginii runda/ioi/clasament | Cod sursa (job #1755087)
#include <fstream>
#define Mod %1999999973
#define unt unsigned __int64
using namespace std;
ifstream cin("lgput.in");
ofstream cout("lgput.out");
unt n,p;
unt PowLog(unt b,unt p)
{
if(p==0)
return 1;
if(p==1)
return b;
if(p%2)
return (b*PowLog(b*b Mod,(p-1)/2)) Mod;
else
return PowLog(b*b Mod,p/2) Mod;
}
int main()
{
cin>>n>>p;
cout<<PowLog(n,p);
return 0;
}