verify/aizu_online_judge/ntl/power.test.cpp

View this file on GitHub
Last update: 2024-11-09 01:34:39+09:00
Problem: https://onlinejudge.u-aizu.ac.jp/courses/library/6/NTL/1/NTL_1_B

Depends on

Code

#define PROBLEM "https://onlinejudge.u-aizu.ac.jp/courses/library/6/NTL/1/NTL_1_B"
#include "../../../src/template/template.hpp"
#include "../../../src/math/pow_mod.hpp"
int main(void) {
    ll m, n;
    cin >> m >> n;
    cout << pow_mod(m, n, 1000000007) << '\n';
}

#line 1 "verify/aizu_online_judge/ntl/power.test.cpp"
#define PROBLEM "https://onlinejudge.u-aizu.ac.jp/courses/library/6/NTL/1/NTL_1_B"
#line 2 "src/template/template.hpp"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<long long, long long>;
#define rep(i, a, b) for(long long i = (a); i < (b); ++i)
#define rrep(i, a, b) for(long long i = (a); i >= (b); --i)
constexpr long long inf = 4e18;
struct SetupIO {
    SetupIO() {
        ios::sync_with_stdio(0);
        cin.tie(0);
        cout << fixed << setprecision(30);
    }
} setup_io;
#line 3 "src/math/pow_mod.hpp"
constexpr long long pow_mod(long long x, long long n, const long long mod) {
    assert(n >= 0 and mod >= 1);
    x %= mod;
    if(x < 0) x += mod;
    long long res = 1;
    while(n > 0) {
        if(n & 1) res = res * x % mod;
        x = x * x % mod;
        n >>= 1;
    }
    return res;
}
#line 4 "verify/aizu_online_judge/ntl/power.test.cpp"
int main(void) {
    ll m, n;
    cin >> m >> n;
    cout << pow_mod(m, n, 1000000007) << '\n';
}