結果

問題 No.1259 スイッチ
ユーザー 👑 hos.lyrichos.lyric
提出日時 2020-10-16 23:14:35
言語 D
(dmd 2.107.1)
結果
AC  
実行時間 90 ms / 2,000 ms
コード長 4,253 bytes
コンパイル時間 1,646 ms
コンパイル使用メモリ 152,388 KB
実行使用メモリ 23,252 KB
最終ジャッジ日時 2023-09-04 10:47:59
合計ジャッジ時間 7,052 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge15
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 35 ms
17,776 KB
testcase_01 AC 36 ms
17,884 KB
testcase_02 AC 33 ms
17,776 KB
testcase_03 AC 32 ms
17,304 KB
testcase_04 AC 35 ms
16,764 KB
testcase_05 AC 33 ms
16,356 KB
testcase_06 AC 36 ms
17,436 KB
testcase_07 AC 35 ms
16,764 KB
testcase_08 AC 36 ms
17,616 KB
testcase_09 AC 36 ms
17,492 KB
testcase_10 AC 69 ms
18,404 KB
testcase_11 AC 85 ms
21,928 KB
testcase_12 AC 67 ms
18,704 KB
testcase_13 AC 52 ms
19,984 KB
testcase_14 AC 62 ms
18,012 KB
testcase_15 AC 54 ms
19,352 KB
testcase_16 AC 77 ms
19,248 KB
testcase_17 AC 62 ms
18,116 KB
testcase_18 AC 84 ms
22,760 KB
testcase_19 AC 83 ms
20,472 KB
testcase_20 AC 69 ms
18,928 KB
testcase_21 AC 90 ms
23,224 KB
testcase_22 AC 52 ms
17,160 KB
testcase_23 AC 86 ms
21,672 KB
testcase_24 AC 73 ms
19,024 KB
testcase_25 AC 69 ms
19,996 KB
testcase_26 AC 89 ms
21,632 KB
testcase_27 AC 80 ms
20,784 KB
testcase_28 AC 70 ms
18,884 KB
testcase_29 AC 78 ms
19,932 KB
testcase_30 AC 43 ms
18,032 KB
testcase_31 AC 49 ms
19,592 KB
testcase_32 AC 39 ms
19,972 KB
testcase_33 AC 53 ms
21,196 KB
testcase_34 AC 42 ms
18,396 KB
testcase_35 AC 45 ms
18,912 KB
testcase_36 AC 46 ms
18,508 KB
testcase_37 AC 45 ms
19,996 KB
testcase_38 AC 43 ms
18,192 KB
testcase_39 AC 52 ms
20,532 KB
testcase_40 AC 51 ms
22,760 KB
testcase_41 AC 46 ms
19,136 KB
testcase_42 AC 51 ms
20,908 KB
testcase_43 AC 43 ms
18,552 KB
testcase_44 AC 50 ms
22,532 KB
testcase_45 AC 51 ms
21,716 KB
testcase_46 AC 45 ms
18,092 KB
testcase_47 AC 53 ms
23,252 KB
testcase_48 AC 43 ms
18,016 KB
testcase_49 AC 51 ms
22,216 KB
testcase_50 AC 65 ms
18,684 KB
testcase_51 AC 51 ms
18,516 KB
testcase_52 AC 88 ms
21,280 KB
testcase_53 AC 58 ms
18,488 KB
testcase_54 AC 86 ms
22,168 KB
testcase_55 AC 51 ms
19,224 KB
testcase_56 AC 60 ms
18,052 KB
testcase_57 AC 83 ms
22,156 KB
testcase_58 AC 66 ms
18,776 KB
testcase_59 AC 77 ms
19,720 KB
testcase_60 AC 90 ms
22,228 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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; }
real readReal() { return readToken.to!real; }

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(int M_) {
  import std.conv : to;
  alias M = M_;
  int x;
  this(ModInt a) { x = a.x; }
  this(long a) { x = cast(int)(a % M); if (x < 0) x += M; }
  ref ModInt opAssign(long a) { return (this = ModInt(a)); }
  ref ModInt opOpAssign(string op)(ModInt a) {
    static if (op == "+") { x += a.x; if (x >= M) x -= M; }
    else static if (op == "-") { x -= a.x; if (x < 0) x += M; }
    else static if (op == "*") { x = cast(int)((cast(long)(x) * a.x) % M); }
    else static if (op == "/") { this *= a.inv(); }
    else static assert(false);
    return this;
  }
  ref ModInt opOpAssign(string op)(long a) {
    static if (op == "^^") {
      if (a < 0) return (this = inv()^^(-a));
      ModInt t2 = this, te = ModInt(1);
      for (long e = a; e > 0; e >>= 1) {
        if (e & 1) te *= t2;
        t2 *= t2;
      }
      x = cast(int)(te.x);
      return this;
    } else return mixin("this " ~ op ~ "= ModInt(a)");
  }
  ModInt inv() const {
    int a = x, b = M, y = 1, z = 0, t;
    for (; ; ) {
      t = a / b; a -= t * b;
      if (a == 0) {
        assert(b == 1 || b == -1);
        return ModInt(b * z);
      }
      y -= t * z;
      t = b / a; b -= t * a;
      if (b == 0) {
        assert(a == 1 || a == -1);
        return ModInt(a * y);
      }
      z -= t * y;
    }
  }
  ModInt opUnary(string op: "-")() const { return ModInt(-x); }
  ModInt opBinary(string op, T)(T a) const {
    return mixin("ModInt(this) " ~ op ~ "= a");
  }
  ModInt opBinaryRight(string op)(long a) const {
    return mixin("ModInt(a) " ~ op ~ "= this");
  }
  bool opCast(T: bool)() const { return (x != 0); }
  string toString() const { return x.to!string; }
}

enum MO = 1000000007;
alias Mint = ModInt!MO;

enum LIM = 10^^6 + 10;
Mint[] inv, fac, invFac;
void prepare() {
  inv = new Mint[LIM];
  fac = new Mint[LIM];
  invFac = new Mint[LIM];
  inv[1] = 1;
  foreach (i; 2 .. LIM) {
    inv[i] = -(Mint.M / i) * inv[cast(size_t)(Mint.M % i)];
  }
  fac[0] = invFac[0] = 1;
  foreach (i; 1 .. LIM) {
    fac[i] = fac[i - 1] * i;
    invFac[i] = invFac[i - 1] * inv[i];
  }
}
Mint binom(long n, long k) {
  if (0 <= k && k <= n) {
    assert(n < LIM);
    return fac[cast(size_t)(n)] * invFac[cast(size_t)(k)] * invFac[cast(size_t)(n - k)];
  } else {
    return Mint(0);
  }
}



void main() {
  prepare;
  
  try {
    for (; ; ) {
      const N = readInt();
      const K = readLong();
      const M = readInt();
      
      auto pw = new Mint[N + 1];
      pw[0] = 1;
      foreach (i; 1 .. N + 1) {
        pw[i] = pw[i - 1] * N;
      }
      
      Mint ans;
      if (M == 1) {
        foreach (l; 1 .. N + 1) {
          if (K % l == 0) {
            ans += fac[N - 1] * invFac[N - l] * pw[N - l];
          }
        }
      } else {
        foreach (l; 1 .. N + 1) {
          if (K % l != 0) {
            ans += fac[N - 2] * invFac[N - l] * pw[N - l];
          }
        }
        foreach (i; 2 .. N + 1) {
          ans += fac[N - 2] * invFac[N - i] * pw[N - i] * (i - 1);
        }
      }
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}
0