test/modint_pow.aoj_DPL_5_A.test.cpp

• View this file on GitHub
• Last update: 2022-07-06 23:37:31+09:00
• Problem: http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=DPL_5_A

Depends on

• mod int (math/mint.hpp)

Code

#define PROBLEM "http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=DPL_5_A"

#include <iostream>
#include "../math/mint.hpp"

int main() {
    int n, k; std::cin >> n >> k;
    std::cout << pow(mint(k), (long long)n) << std::endl;
    return 0;
}

#line 1 "test/modint_pow.aoj_DPL_5_A.test.cpp"
#define PROBLEM "http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=DPL_5_A"

#include <iostream>
#line 3 "math/mint.hpp"
using namespace std;
const int mod = 1000000007;

struct mint {
  long long x;
  mint(long long x = 0) : x((x % mod + mod) % mod) {}
  mint operator-() const { return mint(-x); }
  mint& operator+=(const mint& a) {
    if ((x += a.x) >= mod) x -= mod;
    return *this;
  }
  mint &operator-=(const mint& a) {
    if ((x += mod - a.x) >= mod) x -= mod;
    return *this;
  }
  mint &operator*=(const mint& a) {
    (x *= a.x) %= mod;
    return *this;
  }
  mint operator+(const mint a){ return mint(*this) += a; }
  mint operator-(const mint a){ return mint(*this) -= a; }
  mint operator*(const mint a){ return mint(*this) *= a; }
  mint pow(long long t) const {
    if(!t) return 1;
    mint a = pow(t>>1);
    a *= a;
    if(t&1) a *= *this;
    return a;
  }
  mint inv() const { return pow(mod-2);}
  mint& operator/=(const mint& a) { return *this *= a.inv(); }
  mint operator/(const mint& a){ return mint(*this) /= a; }
};
mint pow(mint a, long long b){
    return a.pow(b);
}
istream& operator>>(istream& is, mint& a) { return is >> a.x; }
ostream& operator<<(ostream& os, const mint& a) { return os << a.x; }
#line 5 "test/modint_pow.aoj_DPL_5_A.test.cpp"

int main() {
    int n, k; std::cin >> n >> k;
    std::cout << pow(mint(k), (long long)n) << std::endl;
    return 0;
}

Back to top page