Pagini recente » Cod sursa (job #1825226) | Diferente pentru algoritmiada-2009 intre reviziile 2 si 3 | Cod sursa (job #2310250) | Cod sursa (job #1617888) | Cod sursa (job #1379887)
#include <fstream>
using namespace std;
#define MOD 1999999973
int put(int n, int p);
int main()
{
ifstream fin("lgput.in");
ofstream fout("lgput.out");
int n, p;
fin>>n>>p;
fout<<put(n, p);
return 0;
}
int put(int n, int p)
{
int rez = 1;
while(p)
{
if(p & 1)
rez = (long long)rez * n % MOD;
n = (long long)n * n % MOD;
p = (p >> 1);
}
return rez;
}