Pagini recente » Cod sursa (job #925304) | Cod sursa (job #3184082) | Cod sursa (job #54156) | Cod sursa (job #425892) | Cod sursa (job #3030556)
#include <fstream>
#include <vector>
#include <queue>
#define M 1999999973
using namespace std;
ifstream cin("lgput.in");
ofstream cout("lgput.out");
vector<int> A[100001];
int n,p;
int viz[100001];
long long power(long long n, long long p)
{
if (p==0) return 1;
long long pow = power(n,p/2)%M;
if (p%2==1) return (((pow*pow)%M)*n)%M;
else return (pow*pow)%M;
}
int main()
{
cin >> n >> p;
cout << power(n,p)%M;
}