Pagini recente » Cod sursa (job #650674) | Cod sursa (job #2982770) | Cod sursa (job #2565922) | Cod sursa (job #576903) | Cod sursa (job #3238539)
#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream cin("lgput.in");
ofstream cout("lgput.out");
int n, m, d[50002], viz[50002], x, y, c;
const int mod=1999999973;
vector<pair<int,int>> v[50002];
int putere(int n, int p)
{
int sol=1;
for(int i=1; i<=p; i<<=1)
{
if((p&i))
sol=(sol*n)%mod;
n=(n*n)%mod;
}
return sol;
}
int main()
{
cin>>n>>m;
cout<<putere(n,m);
}