Pagini recente » Borderou de evaluare (job #3155715) | Borderou de evaluare (job #1577113) | Diferente pentru problema/dans intre reviziile 2 si 13 | Borderou de evaluare (job #1112723) | Cod sursa (job #2850982)
#include <fstream>
using namespace std;
ifstream cin("lgput.in");
ofstream cout("lgput.out");
long long n, k;
long long putere(long long n, long long p){
if(p==0)
return 1;
if(p%2==1){
long long nr=putere(n, p-1);
return n*nr%1999999973;
}
else{
long long nr=putere(n, p/2);
return nr*nr%1999999973;
}
}
int main () {
cin>>n>>k;
cout<<putere(n, k);
}