結果
問題 | No.2487 Multiple of M |
ユーザー |
👑 |
提出日時 | 2023-09-29 22:31:14 |
言語 | D (dmd 2.109.1) |
結果 |
AC
|
実行時間 | 2 ms / 2,000 ms |
コード長 | 4,763 bytes |
コンパイル時間 | 4,048 ms |
コンパイル使用メモリ | 153,544 KB |
実行使用メモリ | 5,376 KB |
最終ジャッジ日時 | 2024-07-23 06:54:09 |
合計ジャッジ時間 | 5,464 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 53 |
コンパイルメッセージ
/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.functional, std.range, std.stdio, std.string;import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, 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.front; tokens.popFront; return token; }int readInt() { return readToken.to!int; }long readLong() { return readToken.to!long; }string COLOR(string s = "") { return "\x1b[" ~ s ~ "m"; }bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1;(unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }struct ModInt(uint M_) {import std.conv : to;alias M = M_;uint x;this(ModInt a) { x = a.x; }this(uint x_) { x = x_ % M; }this(ulong x_) { x = cast(uint)(x_ % M); }this(int x_) { x = ((x_ %= cast(int)(M)) < 0) ? (x_ + cast(int)(M)) : x_; }this(long x_) { x = cast(uint)(((x_ %= cast(long)(M)) < 0) ? (x_ + cast(long)(M)) : x_); }ref ModInt opAssign(T)(inout(T) a) if (is(T == uint) || is(T == ulong) || is(T == int) || is(T == long)) { return this = ModInt(a); }ref ModInt opOpAssign(string op, T)(T a) {static if (is(T == ModInt)) {static if (op == "+") { x = ((x += a.x) >= M) ? (x - M) : x; }else static if (op == "-") { x = ((x -= a.x) >= M) ? (x + M) : x; }else static if (op == "*") { x = cast(uint)((cast(ulong)(x) * a.x) % M); }else static if (op == "/") { this *= a.inv(); }else static assert(false);return this;} else static if (op == "^^") {if (a < 0) return this = inv()^^(-a);ModInt b = this, c = 1U;for (long e = a; e; e >>= 1) { if (e & 1) c *= b; b *= b; }return this = c;} else {return mixin("this " ~ op ~ "= ModInt(a)");}}ModInt inv() const {uint a = M, b = x; int y = 0, z = 1;for (; b; ) { const q = a / b; const c = a - q * b; a = b; b = c; const w = y - cast(int)(q) * z; y = z; z = w; }assert(a == 1); return ModInt(y);}ModInt opUnary(string op)() const {static if (op == "+") { return this; }else static if (op == "-") { ModInt a; a.x = x ? (M - x) : 0U; return a; }else static assert(false);}ModInt opBinary(string op, T)(T a) const { return mixin("ModInt(this) " ~ op ~ "= a"); }ModInt opBinaryRight(string op, T)(T a) const { return mixin("ModInt(a) " ~ op ~ "= this"); }bool opCast(T: bool)() const { return (x != 0U); }string toString() const { return x.to!string; }}enum MO = 998244353;alias Mint = ModInt!MO;// square matrixMint[][] mul(Mint[][] a, Mint[][] b) {const size = cast(int)(a.length);auto c = new Mint[][](size, size);foreach (i; 0 .. size) foreach (k; 0 .. size) foreach (j; 0 .. size) {c[i][j] += a[i][k] * b[k][j];}return c;}Mint[] mul(Mint[][] a, Mint[] x) {const size = cast(int)(a.length);auto y = new Mint[size];foreach (i; 0 .. size) foreach (j; 0 .. size) {y[i] += a[i][j] * x[j];}return y;}Mint[][] power(Mint[][] a, long e) {const size = cast(int)(a.length);auto b = new Mint[][](size, size), c = new Mint[][](size, size);foreach (i; 0 .. size) foreach (j; 0 .. size) b[i][j] = a[i][j];foreach (i; 0 .. size) foreach (j; 0 .. size) c[i][j] = (i == j) ? 1 : 0;for (; e; e >>= 1) {if (e & 1) c = mul(c, b);b = mul(b, b);}return c;}// [1, M)// 0 mod LMint solve(long N, long M, long K, long L) {Mint ret;if (N == 0) {ret = 1;} else {const g = gcd(K, L);if (g == 1) {auto a = new Mint[][](2, 2);a[0][0] = M/L - 1;a[0][1] = M - M/L;a[1][0] = M/L;a[1][1] = M - 1 - M/L;const aa = power(a, N);ret = aa[0][0];} else {const all = Mint(M - 1)^^(N-1);const res = solve(N - 1, M, K, L/g);ret += res * (M/L - 1);ret += (all - res) * (M/L);}}debug {writefln("N = %s, M = %s, K = %s: %s", N, M, K, ret);}return ret;}void main() {try {for (; ; ) {const N = readLong;const M = readLong;const K = readLong;const ans = solve(N, M, K, M);writeln(ans);}} catch (EOFException e) {}}