Pagini recente » Cod sursa (job #3127261) | Cod sursa (job #1324756) | Cod sursa (job #726611) | Cod sursa (job #2805453) | Cod sursa (job #1798452)
#include <fstream>
#define MOD 1999999973
using namespace std;
ifstream f("lgput.in");
ofstream g("lgput.out");
long long int RidicareLaPutere(long long int n, long long int p)
{
if (n == 1 || p == 0)
return 1;
if (p == 1)
return n % MOD;
if (p % 2 == 1)
return ((n % MOD) * (RidicareLaPutere(n, p - 1) % MOD)) % MOD;
return ((RidicareLaPutere(n, p / 2) % MOD) * (RidicareLaPutere(n, p / 2) % MOD)) % MOD;
}
int main()
{
unsigned int n, p;
f >> n >> p;
g << RidicareLaPutere(n, p);
return 0;
}