Pagini recente » Cod sursa (job #2186983) | Cod sursa (job #103550) | Cod sursa (job #1801545) | Istoria paginii warm-up-2020/solutii/cuantictiori | Cod sursa (job #2943676)
#include<iostream>
#include<fstream>
using namespace std;
ifstream fin("lgput.in");
ofstream fout("lgput.out");
int M=1999999973;
int putere(int n,int a){
int p=1;
while(n){
cifb=n%2;
if(cifb>0) p=(long long)p*a%M;
a=(long long)a*a;
}
return p;
}
int main(){
int n,p;
fin>>n>>p;
fout<<putere(n,p);
fin.close();
fout.close();
return 0;
}