Pagini recente » Cod sursa (job #64570) | Cod sursa (job #300878) | Cod sursa (job #1615365) | Cod sursa (job #2331975) | Cod sursa (job #2450756)
#include <fstream>
#include<bits/stdc++.h>
#include<algorithm>
#define mod 1999999973
using namespace std;
ifstream fin("lgput.in");
ofstream fout("lgput.out");
long long n,p;
long long power(long long n,long long p) {
if(p==0) return 1;
if(p%2==0) return (power(n,p/2)%mod * power(n,p/2)%mod ) % mod;
else return ((n*(power(n,p/2)%mod))%mod *(power(n,p/2)%mod))%mod;
}
int main()
{
fin>>n>>p;
fout<<power(n,p);
}