Pagini recente » Cod sursa (job #1187883) | Diferente pentru problema/numere6 intre reviziile 6 si 7 | Cod sursa (job #2769178) | Cod sursa (job #625795) | Cod sursa (job #1758746)
#include <cstdio>
using namespace std;
const int M = 1999999973;
long long log_pow(long long n, long long p){
long long ans = 1;
for ( ; p; p >>= 1 ) {
if ( p & 1 )
ans = ( ans * n ) % M;
n = ( n * n ) % M;
}
return ans;
}
int main() {
freopen ( "lgput.in", "r", stdin );
freopen ( "lgput.out", "w", stdout );
long long n, p;
scanf ( "%lld%lld", &n, &p );
printf ( "%lld", log_pow( n % M, p ) );
return 0;
}