BOJ 24009 - Huge Numbers [C++]

문제

링크

풀이

#include <iostream>
using namespace std;
 
long long power(long long base, long long exp, long long mod) {
  long long ret = 1;
  while (exp) {
    if (exp & 1) ret = ret * base % mod;
    base = base * base % mod;
    exp >>= 1;
  }
  return ret;
}
 
void solve(int idx) {
  int a, n, p; cin >> a >> n >> p;
 
  long long ans = a % p;
  for (int i=2; i<=n; i++) {
    ans = power(ans, i, p);
  }
  cout << "Case #" << idx << ": " << ans << "\n";
}
 
int main(void) {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
 
  int t; cin >> t;
  for (int i=1; i<=t; i++) solve(i);
  return 0;
}