Pagini recente » Cod sursa (job #2977803) | Cod sursa (job #2548768) | Borderou de evaluare (job #1511755) | Diferente pentru problema/weightgraph intre reviziile 20 si 19 | Cod sursa (job #1829600)
#include <fstream>
using namespace std;
ifstream in("lgput.in");
ofstream out("lgput.out");
long long n,p;
const long long md=1999999973;
long long put(int n, int p)
{
if(p)
{
if(p%2==0)
{
long long k=put(n,p/2);
return (k*k)%1999999973;
}
else return (put(n,p-1)*n)%1999999973;
}
else return 1;
}
int main()
{
in>>n>>p;
out<<put(n,p);
return 0;
}