verify-check/AOJ-NTL-1-B.test.cpp

View this file on GitHub
Last update: 2023-09-17 18:49:22+09:00
Problem: https://onlinejudge.u-aizu.ac.jp/courses/library/6/NTL/1/NTL_1_B

Depends on

繰り返し二乗法（C++） (num_theory/pow.cpp)

Code

#define PROBLEM "https://onlinejudge.u-aizu.ac.jp/courses/library/6/NTL/1/NTL_1_B"
#include <iostream>
#include "num_theory/pow.cpp"
using namespace std;
int main() {
    long long m, n;
    cin >> m >> n;
    long long ans = mod_pow(m, n, MOD);
    cout << ans << endl;
    return 0;
}

#line 1 "verify-check/AOJ-NTL-1-B.test.cpp"
#define PROBLEM "https://onlinejudge.u-aizu.ac.jp/courses/library/6/NTL/1/NTL_1_B"
#include <iostream>
#line 2 "num_theory/pow.cpp"
using namespace std;

const long long MOD = 1000000007;  // 10^9 + 7

long long mod_pow(long long base, long long exp, long long mod) {
    long long result = 1;
    while (exp > 0) {
        if (exp % 2 == 1) {
            result = (result * base) % mod;
        }
        base = (base * base) % mod;
        exp /= 2;
    }
    return result;
}
#line 4 "verify-check/AOJ-NTL-1-B.test.cpp"
using namespace std;
int main() {
    long long m, n;
    cin >> m >> n;
    long long ans = mod_pow(m, n, MOD);
    cout << ans << endl;
    return 0;
}