Pagini recente » Cod sursa (job #2842115) | Cod sursa (job #2357844) | Cod sursa (job #214183) | Cod sursa (job #2389349) | Cod sursa (job #2812970)
#include <fstream>
//#include <iostream>
using namespace std;
ifstream cin ("lgput.in");
ofstream cout ("lgput.out");
int n, exponent, mod = 1999999973;
int Putere(int A , int n)
{
if (n == 0)
return 1;
if (n%2==1)
return A * Putere(A, n-1);
int P = Putere(A , n / 2);
return P * P;
}
int main ()
{
cin >> n >> exponent;
cout << Putere(n,exponent) % mod;
}