結果

問題 No.890 移調の限られた旋法
ユーザー 👑 hos.lyrichos.lyric
提出日時 2019-09-20 21:37:00
言語 D
(dmd 2.106.1)
結果
AC  
実行時間 88 ms / 2,000 ms
コード長 3,670 bytes
コンパイル時間 1,397 ms
コンパイル使用メモリ 152,452 KB
実行使用メモリ 36,716 KB
最終ジャッジ日時 2023-09-04 02:48:16
合計ジャッジ時間 7,505 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge13
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 86 ms
35,404 KB
testcase_01 AC 84 ms
35,116 KB
testcase_02 AC 81 ms
36,404 KB
testcase_03 AC 85 ms
34,880 KB
testcase_04 AC 82 ms
35,452 KB
testcase_05 AC 83 ms
35,308 KB
testcase_06 AC 83 ms
35,832 KB
testcase_07 AC 81 ms
35,460 KB
testcase_08 AC 79 ms
36,716 KB
testcase_09 AC 81 ms
35,164 KB
testcase_10 AC 79 ms
35,784 KB
testcase_11 AC 80 ms
35,336 KB
testcase_12 AC 85 ms
34,948 KB
testcase_13 AC 85 ms
35,628 KB
testcase_14 AC 86 ms
34,852 KB
testcase_15 AC 85 ms
35,752 KB
testcase_16 AC 86 ms
35,380 KB
testcase_17 AC 88 ms
34,816 KB
testcase_18 AC 83 ms
35,060 KB
testcase_19 AC 88 ms
34,968 KB
testcase_20 AC 86 ms
36,268 KB
testcase_21 AC 78 ms
35,528 KB
testcase_22 AC 85 ms
34,880 KB
testcase_23 AC 85 ms
35,376 KB
testcase_24 AC 85 ms
35,188 KB
testcase_25 AC 80 ms
35,204 KB
testcase_26 AC 83 ms
35,332 KB
testcase_27 AC 86 ms
34,788 KB
testcase_28 AC 81 ms
34,916 KB
testcase_29 AC 87 ms
35,940 KB
testcase_30 AC 88 ms
34,940 KB
testcase_31 AC 85 ms
34,876 KB
testcase_32 AC 85 ms
34,796 KB
testcase_33 AC 83 ms
36,556 KB
testcase_34 AC 88 ms
35,132 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.complex, std.container, std.math, 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(long 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 assert(false);
    return this;
  }
  ref ModInt opOpAssign(string op)(long a) {
    static if (op == "^^") {
      ModInt t2 = this, te = ModInt(1);
      for (long e = a; e; e >>= 1) {
        if (e & 1) te *= t2;
        t2 *= t2;
      }
      x = cast(int)(te.x);
      return this;
    } else return mixin("this " ~ op ~ "= ModInt(a)");
  }
  ModInt opUnary(string op)() const if (op == "-") { 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"); }
  string toString() const { return x.to!string; }
}

enum MO = 10L^^9 + 7;
alias Mint = ModInt!MO;

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

void main() {
  prepare();
  
  auto minp = iota(LIM).array;
  foreach (p; 2 .. LIM) {
    if (minp[p] == p) {
      for (int n = p; n < LIM; n += p) {
        chmin(minp[n], p);
      }
    }
  }
  auto meb = new int[LIM];
  meb[1] = 1;
  foreach (n; 2 .. LIM) {
    const p = minp[n];
    if (n / p % p != 0) {
      meb[n] = -meb[n / p];
    }
  }
  debug {
    writeln(minp[0 .. 31]);
    writeln(meb[0 .. 31]);
  }
  
  try {
    for (; ; ) {
      const N = readInt();
      const K = readInt();
      
      Mint ans;
      foreach (d; 1 .. N + 1) {
        if (N % d == 0) {
          if (K % d == 0) {
            ans += meb[d] * binom(N / d, K / d);
          }
        }
      }
      ans = binom(N, K) - ans;
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}
0