結果
問題 | No.181 A↑↑N mod M |
ユーザー | 👑 hos.lyric |
提出日時 | 2019-01-10 15:05:33 |
言語 | D (dmd 2.106.1) |
結果 |
AC
|
実行時間 | 2 ms / 5,000 ms |
コード長 | 2,242 bytes |
コンパイル時間 | 773 ms |
コンパイル使用メモリ | 119,040 KB |
実行使用メモリ | 6,948 KB |
最終ジャッジ日時 | 2024-06-13 02:33:37 |
合計ジャッジ時間 | 2,037 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
6,812 KB |
testcase_01 | AC | 1 ms
6,944 KB |
testcase_02 | AC | 1 ms
6,940 KB |
testcase_03 | AC | 1 ms
6,940 KB |
testcase_04 | AC | 2 ms
6,940 KB |
testcase_05 | AC | 1 ms
6,940 KB |
testcase_06 | AC | 1 ms
6,940 KB |
testcase_07 | AC | 1 ms
6,944 KB |
testcase_08 | AC | 1 ms
6,944 KB |
testcase_09 | AC | 1 ms
6,940 KB |
testcase_10 | AC | 1 ms
6,944 KB |
testcase_11 | AC | 1 ms
6,940 KB |
testcase_12 | AC | 1 ms
6,940 KB |
testcase_13 | AC | 1 ms
6,944 KB |
testcase_14 | AC | 1 ms
6,940 KB |
testcase_15 | AC | 1 ms
6,944 KB |
testcase_16 | AC | 1 ms
6,940 KB |
testcase_17 | AC | 1 ms
6,948 KB |
testcase_18 | AC | 2 ms
6,940 KB |
testcase_19 | AC | 1 ms
6,940 KB |
testcase_20 | AC | 1 ms
6,940 KB |
testcase_21 | AC | 1 ms
6,944 KB |
testcase_22 | AC | 1 ms
6,944 KB |
testcase_23 | AC | 1 ms
6,940 KB |
testcase_24 | AC | 1 ms
6,944 KB |
testcase_25 | AC | 1 ms
6,940 KB |
testcase_26 | AC | 1 ms
6,944 KB |
testcase_27 | AC | 1 ms
6,940 KB |
testcase_28 | AC | 2 ms
6,944 KB |
testcase_29 | AC | 1 ms
6,940 KB |
testcase_30 | AC | 1 ms
6,944 KB |
testcase_31 | AC | 2 ms
6,940 KB |
testcase_32 | AC | 1 ms
6,940 KB |
testcase_33 | AC | 1 ms
6,940 KB |
testcase_34 | AC | 1 ms
6,944 KB |
testcase_35 | AC | 2 ms
6,940 KB |
testcase_36 | AC | 2 ms
6,944 KB |
testcase_37 | AC | 2 ms
6,940 KB |
testcase_38 | AC | 2 ms
6,944 KB |
testcase_39 | AC | 2 ms
6,940 KB |
testcase_40 | AC | 1 ms
6,940 KB |
testcase_41 | AC | 1 ms
6,940 KB |
testcase_42 | AC | 2 ms
6,940 KB |
コンパイルメッセージ
/home/linuxbrew/.linuxbrew/opt/dmd/include/dlang/dmd/std/numeric.d(2999): Warning: cannot inline function `std.numeric.gcdImpl!ulong.gcdImpl`
ソースコード
import std.conv, std.stdio, std.string;import std.algorithm, std.array, std.bigint, std.container, std.math, std.numeric, std.range, std.regex, std.typecons;import core.bitop;class EOFException : Throwable { this() { super("EOF"); } }string[] tokens;string readToken() { for (; tokens.empty; ) { if (stdin.eof) throw new EOFException; tokens = readln.split; } auto token = tokens[0]; tokens.popFront;return token; }int readInt() { return readToken().to!int; }long readLong() { return readToken().to!long; }real readReal() { return readToken().to!real; }void chmin(T)(ref T t, in T f) { if (t > f) t = f; }void chmax(T)(ref T t, in T f) { if (t < f) t = f; }int binarySearch(T)(in T[] as, in bool delegate(T) test) { int low = -1, upp = cast(int)(as.length); for (; low + 1 < upp; ) { int mid = (low + upp)>> 1; (test(as[mid]) ? low : upp) = mid; } return upp; }int lowerBound(T)(in T[] as, in T val) { return as.binarySearch((T a) => (a < val)); }int upperBound(T)(in T[] as, in T val) { return as.binarySearch((T a) => (a <= val)); }long lcm(long a, long b) {return a / gcd(a, b) * b;}immutable L = 10;long mod(long a, long m) {return (a < L) ? a : (L + (a - L) % m);}long power(long a, long e, long m) {long x = a, y = 1;for (; e; e >>= 1) {if (e & 1) {y = mod(y * x, m);}x = mod(x * x, m);}return y;}long arrow2(long a, long n, long m) {if (n == 0) {return 1;}if (n == 1) {return mod(a, m);}if (n == 2) {return power(a, a, m);}if (a == 1) {return 1;}if (m == 1) {// a >= 2, n >= 3return L;}long period = 1;long mm = m;for (long d = 2; d * d <= mm; ++d) {if (mm % d == 0) {long pk = 1;do {pk *= d;mm /= d;} while (mm % d == 0);period = lcm(period, (d == 2 && pk >= 8) ? (pk / 4) : (pk / d * (d - 1)));}}if (mm > 1) {period = lcm(period, mm - 1);}return power(a, arrow2(a, n - 1, period), m);}long A, N, M;void main() {try {for (; ; ) {A = readLong();N = readLong();M = readLong();auto ans = arrow2(A, N, M);ans %= M;writeln(ans);}} catch (EOFException e) {}}