src/math/mod_pow.hpp

• View this file on GitHub
• Last update: 2022-12-18 23:03:49+09:00
• Include: #include "src/math/mod_pow.hpp"

Verified with

• test/aoj/ntl_1_b.test.cpp

Code

#pragma once

#include <bits/stdc++.h>
using namespace std;

template <typename T = long long> T mod_pow(T a, T n, T mod) {
  T res = 1;
  while (n > 0) {
    if (n & 1) {
      res = res * a % mod;
    }
    a = a * a % mod;
    n >>= 1;
  }
  return res;
}

#line 2 "src/math/mod_pow.hpp"

#include <bits/stdc++.h>
using namespace std;

template <typename T = long long> T mod_pow(T a, T n, T mod) {
  T res = 1;
  while (n > 0) {
    if (n & 1) {
      res = res * a % mod;
    }
    a = a * a % mod;
    n >>= 1;
  }
  return res;
}

Back to top page