Pagini recente » Istoria paginii runda/preojixxx | Cod sursa (job #2430001) | Cod sursa (job #2575227) | Cod sursa (job #2358767) | Cod sursa (job #830697)
Cod sursa(job #830697)
#include<fstream>
#include<math.h>
using namespace std;
double putere(double n, double k){
if(k > 1){
if((int)k %2 ==1){
return n * pow(putere(n,k/2),2);
}
else return pow(putere(n,k/2),2);
}
else if(k == 1)
return n;
else return 1;
}
int main(){
double n, k;
ifstream fin("lgput.in");
ofstream fout("lgput.out");
fin >> n >> k;
fout << (int)putere(n,k) % 1999999973;
return 0;
}