Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- using namespace std;
- int binpow(int a, int n, int mod) {
- if (n == 0) return 1;
- if (n % 2 == 1) {
- int b = binpow(a, n - 1, mod);
- return (b * a) % mod;
- } else {
- int b = binpow(a, n / 2, mod);
- return (b * b) % mod;
- }
- }
- int main(){
- int m, n;
- cin >> m >> n;
- int ans = (binpow(m, 5, n) + 17) % n / 2;
- ans = (ans * binpow(m, 5, n)) % n;
- cout << ans << endl;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement