Pagini recente » Cod sursa (job #2159119) | Cod sursa (job #939374) | Cod sursa (job #1070753) | Cod sursa (job #1726773) | Cod sursa (job #2500370)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("lgput.in");
ofstream fout("lgput.out");
const int mod = 1999999973;
long long n, p, r = 1;
int ridput(int n, int p)
{
if(p == 0)
return 1;
else if(p == 1)
return n % mod;
else if(p % 2 == 0)
return ridput((n % mod) * (n % mod), p / 2);
else
return (n % mod) * (ridput((n % mod) * (n % mod), (p - 1) / 2)) % mod;
}
int main()
{
fin >> n >> p;
fout << ridput(n, p);
return 0;
}