Submit Info #4564

Problem Lang User Status Time Memory
Tetration Mod cpp ei1333 AC 253 ms 0.73 MiB

ケース詳細
Name Status Time Memory
example_00 AC 1 ms 0.72 MiB
example_01 AC 2 ms 0.68 MiB
max_00 AC 49 ms 0.72 MiB
max_01 AC 46 ms 0.68 MiB
max_02 AC 44 ms 0.67 MiB
max_1000000000_00 AC 16 ms 0.72 MiB
max_1000000000_01 AC 17 ms 0.73 MiB
max_1000000000_02 AC 14 ms 0.71 MiB
max_998244353_00 AC 251 ms 0.72 MiB
max_998244353_01 AC 253 ms 0.67 MiB
max_998244353_02 AC 248 ms 0.68 MiB
random_00 AC 30 ms 0.69 MiB
random_01 AC 7 ms 0.68 MiB
random_02 AC 8 ms 0.72 MiB
random_03 AC 12 ms 0.71 MiB
random_04 AC 25 ms 0.71 MiB
small_00 AC 2 ms 0.68 MiB

#include <bits/stdc++.h> using namespace std; using int64 = long long; const int mod = 998244353; const int64 infll = (1LL << 62) - 1; const int inf = (1 << 30) - 1; struct IoSetup { IoSetup() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(10); cerr << fixed << setprecision(10); } } iosetup; template< typename T1, typename T2 > ostream &operator<<(ostream &os, const pair< T1, T2 > &p) { os << p.first << " " << p.second; return os; } template< typename T1, typename T2 > istream &operator>>(istream &is, pair< T1, T2 > &p) { is >> p.first >> p.second; return is; } template< typename T > ostream &operator<<(ostream &os, const vector< T > &v) { for(int i = 0; i < (int) v.size(); i++) { os << v[i] << (i + 1 != v.size() ? " " : ""); } return os; } template< typename T > istream &operator>>(istream &is, vector< T > &v) { for(T &in : v) is >> in; return is; } template< typename T1, typename T2 > inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); } template< typename T1, typename T2 > inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); } template< typename T = int64 > vector< T > make_v(size_t a) { return vector< T >(a); } template< typename T, typename... Ts > auto make_v(size_t a, Ts... ts) { return vector< decltype(make_v< T >(ts...)) >(a, make_v< T >(ts...)); } template< typename T, typename V > typename enable_if< is_class< T >::value == 0 >::type fill_v(T &t, const V &v) { t = v; } template< typename T, typename V > typename enable_if< is_class< T >::value != 0 >::type fill_v(T &t, const V &v) { for(auto &e : t) fill_v(e, v); } template< typename F > struct FixPoint : F { explicit FixPoint(F &&f) : F(forward< F >(f)) {} template< typename... Args > decltype(auto) operator()(Args &&... args) const { return F::operator()(*this, forward< Args >(args)...); } }; template< typename F > inline decltype(auto) MFP(F &&f) { return FixPoint< F >{forward< F >(f)}; } template< typename T > T mod_pow(T x, T n, const T &p) { T ret = 1; while(n > 0) { if(n & 1) (ret *= x) %= p; (x *= x) %= p; n >>= 1; } return ret % p; } /** * @brief Euler's-Phi-Function(オイラーのφ関数) * @docs docs/euler-phi.md */ template< typename T > T euler_phi(T n) { T ret = n; for(T i = 2; i * i <= n; i++) { if(n % i == 0) { ret -= ret / i; while(n % i == 0) n /= i; } } if(n > 1) ret -= ret / n; return ret; } /** * @brief Mod-Tetration */ template< typename T > T mod_tetration(const T &a, const T &b, const T &m) { if(m == 1) return 0; if(a == 0) return ~b & 1; if(b == 0) return 1; if(b == 1) return a % m; if(b == 2) return mod_pow(a % m, a, m); auto phi = euler_phi(m); return mod_pow(a % m, mod_tetration(a, b - 1, phi) + phi, m); } int main() { int T; cin >> T; while(T--) { int a, b, m; cin >> a >> b >> m; cout << mod_tetration< int64 >(a, b, m) % m << "\n"; } }