結果

問題 No.1164 GCD Products hard
ユーザー 👑 hos.lyrichos.lyric
提出日時 2020-08-27 23:50:28
言語 D
(dmd 2.106.1)
結果
AC  
実行時間 1,031 ms / 2,500 ms
コード長 4,103 bytes
コンパイル時間 1,654 ms
コンパイル使用メモリ 155,844 KB
実行使用メモリ 42,204 KB
最終ジャッジ日時 2024-06-22 08:22:10
合計ジャッジ時間 15,692 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 663 ms
30,328 KB
testcase_01 AC 785 ms
32,428 KB
testcase_02 AC 485 ms
24,844 KB
testcase_03 AC 166 ms
10,456 KB
testcase_04 AC 114 ms
11,452 KB
testcase_05 AC 610 ms
30,216 KB
testcase_06 AC 669 ms
35,944 KB
testcase_07 AC 685 ms
36,788 KB
testcase_08 AC 657 ms
36,268 KB
testcase_09 AC 483 ms
25,816 KB
testcase_10 AC 157 ms
9,924 KB
testcase_11 AC 522 ms
27,852 KB
testcase_12 AC 755 ms
35,228 KB
testcase_13 AC 444 ms
22,248 KB
testcase_14 AC 305 ms
25,860 KB
testcase_15 AC 688 ms
37,060 KB
testcase_16 AC 373 ms
28,432 KB
testcase_17 AC 613 ms
28,508 KB
testcase_18 AC 559 ms
27,108 KB
testcase_19 AC 110 ms
11,352 KB
testcase_20 AC 248 ms
16,084 KB
testcase_21 AC 804 ms
37,164 KB
testcase_22 AC 1 ms
6,944 KB
testcase_23 AC 412 ms
42,204 KB
testcase_24 AC 1,031 ms
42,064 KB
testcase_25 AC 1 ms
6,940 KB
testcase_26 AC 1 ms
6,940 KB
testcase_27 AC 2 ms
6,940 KB
testcase_28 AC 2 ms
6,944 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 = 10^^9 + 7;
alias Mint = ModInt!MO;

enum LIM_E = 30;

void main() {
  try {
    for (; ; ) {
      const A = readInt();
      const B = readInt();
      const N = readLong();
      
      auto lpf = iota(B + 1).array;
      foreach (p; 2 .. B + 1) {
        if (lpf[p] == p) {
          for (int n = 2 * p; n <= B; n += p) {
            chmin(lpf[n], p);
          }
        }
      }
      
      Mint ans = 1;
      auto fs = new ModInt!(MO - 1)[LIM_E];
      foreach (p; 2 .. B + 1) {
        if (lpf[p] == p) {
          int maxE;
          for (int n = (A + p - 1) / p * p; n <= B; n += p) {
            int e;
            int nn = n;
            do {
              ++e;
              nn /= p;
            } while (nn % p == 0);
            fs[e] += 1;
            chmax(maxE, e);
          }
          debug {
            writeln("p = ", p, ": fs = ", fs);
          }
          foreach_reverse (e; 1 .. maxE) {
            fs[e] += fs[e + 1];
          }
          foreach (e; 1 .. maxE + 1) {
            fs[e] ^^= N;
          }
          const sum = fs[1 .. maxE + 1].sum;
          ans *= Mint(p)^^(sum.x);
          fs[1 .. maxE + 1] = ModInt!(MO - 1)(0);
        }
      }
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}
0