Cod sursa(job #2981288)
Utilizator | Data | 17 februarie 2023 17:20:06 | |
---|---|---|---|
Problema | Ridicare la putere in timp logaritmic | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include <bits/stdc++.h>
using namespace std;
int modpow(int x, int n, int m) {
if (n == 0) return 1%m;
long long u = modpow(x,n/2,m);
u = (u*u)%m;
if (n%2 == 1) u = (u*x)%m;
return u;
}
int main()
{
long long m = 1999999973;
long long n, p;
cin >> n >> p;
cout << modpow(n,p,m);
}