Pagini recente » Cod sursa (job #684941) | Cod sursa (job #1859956) | Cod sursa (job #2483916) | Cod sursa (job #1351474) | Cod sursa (job #1878939)
#include <fstream>
#define md 1999999973
using namespace std;
ifstream fi ("lgput.in");
ofstream fo ("lgput.out");
long long n, p, a = 1, s = 1, cn;
int main ()
{
fi >> n >> p;
cn = n;
while (a*2 < p || a*2 == p)
{
n = (n*n)%md;
a*=2;
}
s*=n;
s%=md;
if (p - a > 0)
{
p-=a;
cn = n;
a = 1;
}
else
{
fo << s;
return 0;
}
while (a*2 < p || a*2 == p)
{
n = (n*n)%md;
a*=2;
}
s*=n;
s%=md;
if (p - a > 0)
{
p-=a;
cn = n;
a = 1;
}
else
{
fo << s;
return 0;
}
return 0;
}