Pagini recente » Borderou de evaluare (job #1248043) | Cod sursa (job #138162) | Rezultatele filtrării | Rezultatele filtrării | Cod sursa (job #1154192)
#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#define MAX 50000
using namespace std;
long compose (long n, long p){
long c;
if(p == 1) return n;
if(p == 0) return 1;
c = compose(n,p / 2);
if(p % 2 == 0){
return c * c;
}
return c*c*n;
}
int main(){
ifstream fin("lgput.in");
ofstream fout("lgput.out");
long n, p;
fin >> n >> p;
fout << compose(n, p) % 1999999973;
return 0;
}