#275851 (C++14) No.181 A↑↑N mod M

• 問題: No.181 A↑↑N mod M
• ユーザー: Yang33
• 提出日時: 2018-07-30 12:25:58
• 言語: C++14 (gcc 13.3.0 + boost 1.87.0)
• 結果: AC
• 実行時間: 2 ms / 5,000 ms
• コード長: 2,083 bytes
• コンパイル時間: 1,792 ms
• コンパイル使用メモリ: 168,440 KB
• 実行使用メモリ: 5,376 KB
• 最終ジャッジ日時: 2024-09-13 15:54:21
• 合計ジャッジ時間: 3,171 ms
• ジャッジサーバーID （参考情報）: judge1 / judge3

ファイルパターン	結果
sample	AC * 6
other	AC * 37

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
#include <bits/stdc++.h>
using namespace std;
using VS = vector<string>;    using LL = long long;
using VI = vector<int>;       using VVI = vector<VI>;
using PII = pair<int, int>;   using PLL = pair<LL, LL>;
using VL = vector<LL>;        using VVL = vector<VL>;
#define ALL(a)  begin((a)),end((a))
#define RALL(a) (a).rbegin(), (a).rend()
#define SZ(a) int((a).size())
#define SORT(c) sort(ALL((c)))
#define RSORT(c) sort(RALL((c)))
#define UNIQ(c) (c).erase(unique(ALL((c))), end((c)))
#define FOR(i, s, e) for (int(i) = (s); (i) < (e); (i)++)
#define FORR(i, s, e) for (int(i) = (s); (i) > (e); (i)--)
#define debug(x) cerr << #x << ": " << x << endl
const int INF = 1e9;                          const LL LINF = 1e16;
const LL MOD = 1000000007;                    const double PI = acos(-1.0);
int DX[8] = { 0, 0, 1, -1, 1, 1, -1, -1 };    int DY[8] = { 1, -1, 0, 0, 1, -1, 1, -1 };
/* -----  2018/07/30  Problem: yukicoder 181  / Link: http://yukicoder.me/problems/no/181  ----- */
/* ------問題------
-----問題ここまで----- */
/* -----解説等-----
----解説ここまで---- */
VI euler;
void get_euler_phi(int n) {
    euler = VI(n + 1);
    for (int i = 0; i <= n; i++) {
        euler[i] = i;
    }
    for (int i = 2; i <= n; i++) {
        if (euler[i] == i) {
            for (int j = i; j <= n; j += i) {
                euler[j] = euler[j] / i * (i - 1);
            }
        }
    }
}
long long  powmod(long long  x, long long  n, long long  mod) {
    long long  res = 1;
    while (n > 0) {
        if (n & 1) {
            res = (res*x) % mod;
        }
        x = (x*x) % mod;
        n >>= 1;
    }
    return res;
}
LL g(LL A, LL N) { // A^^N
    if (A == 1 || N == 0)return 1;
    if (N == 1)return A;
    if (N == 2)return A*A;
    return INF;
}
LL f(LL a, LL n, LL m) {// A^^N mod m
    if (m == 1)return 0;
    if (n == 0)return 1;
    if (g(a, n - 1) < euler[m]) {
        return powmod(a, f(a, n - 1, euler[m]), m);
    }
    else {
        return powmod(a, f(a, n - 1, euler[m]) + euler[m], m);
    }
}
int main() {
    cin.tie(0);
    ios_base::sync_with_stdio(false);
    LL A, N, M; cin >> A >> N >> M;
    get_euler_phi(M + 1);
    LL ans = f(A, N, M);
    cout << ans << "\n";
    return 0;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX