Pagini recente » Cod sursa (job #1538268) | Monitorul de evaluare | Cod sursa (job #2629747) | Cod sursa (job #2784264) | Cod sursa (job #2664177)
#include <stdio.h>
using namespace std;
const int MOD = 1999999973;
int lgput( int a, int n ) {
int p = 1;
while (n > 0) {
if (n % 2 == 1)
p = ( ( long long ) p * a) % MOD;
a = ( long long ) a * a % MOD;
n >>= 1;
}
return p;
}
int main() {
FILE *fin, *fout;
int a, n;
fin = fopen ( "lgput.in", "r" );
fscanf( fin, "%d%d", &a, &n );
fclose( fin );
fout = fopen ( "lgput.out", "w" );
fprintf(fout, "%d", lgput(a, n) );
fclose( fout );
return 0;
}