Pagini recente » Cod sursa (job #250612) | Cod sursa (job #2383443) | Cod sursa (job #2719415) | Cod sursa (job #1912715) | Cod sursa (job #2231003)
#include <iostream>
#include <fstream>
#define mod 1999999973
using namespace std;
ifstream f ("lgput.in");
ofstream g ("lgput.out");
int N, P;
int ridicare_la_putere(int n, int p)
{
if (p < 0)
return ridicare_la_putere(1 / n, -p);
else if (p == 0)
return 1;
else if (p == 1)
return n;
else if (!(p % 2))
return ridicare_la_putere(n * n, p / 2) % mod ;
else if (p % 2)
return n % mod * ridicare_la_putere(n * n, (p - 1) / 2) % mod;
}
int main()
{
f >> N >> P;
g << ridicare_la_putere(N, P);
return 0;
}