Pagini recente » Cod sursa (job #898876) | Cod sursa (job #2453986) | Cod sursa (job #1793419) | Cod sursa (job #504032) | Cod sursa (job #3030545)
#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*n)%M;
else return (pow*pow);
}
int main()
{
cin >> n >> p;
cout << power(n,p);
}