結果

問題 No.1039 Project Euler でやれ
ユーザー 👑 hos.lyrichos.lyric
提出日時 2020-04-24 22:01:01
言語 D
(dmd 2.106.1)
結果
AC  
実行時間 8 ms / 2,000 ms
コード長 4,357 bytes
コンパイル時間 1,374 ms
コンパイル使用メモリ 158,864 KB
実行使用メモリ 6,944 KB
最終ジャッジ日時 2024-06-22 06:44:51
合計ジャッジ時間 2,162 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,812 KB
testcase_01 AC 5 ms
6,944 KB
testcase_02 AC 6 ms
6,940 KB
testcase_03 AC 7 ms
6,940 KB
testcase_04 AC 8 ms
6,944 KB
testcase_05 AC 6 ms
6,940 KB
testcase_06 AC 5 ms
6,940 KB
testcase_07 AC 2 ms
6,940 KB
testcase_08 AC 3 ms
6,944 KB
testcase_09 AC 3 ms
6,940 KB
testcase_10 AC 2 ms
6,944 KB
testcase_11 AC 5 ms
6,940 KB
testcase_12 AC 2 ms
6,944 KB
testcase_13 AC 1 ms
6,940 KB
testcase_14 AC 4 ms
6,940 KB
testcase_15 AC 4 ms
6,944 KB
testcase_16 AC 1 ms
6,940 KB
testcase_17 AC 1 ms
6,944 KB
testcase_18 AC 1 ms
6,944 KB
testcase_19 AC 1 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;


Mint solve(int p, int e) {
  auto pp = new Mint[e + 1];
  pp[0] = 1;
  foreach (f; 1 .. e + 1) {
    pp[f] = pp[f - 1] * p;
  }
  
  Mint ret;
  void dfs(int ee, int last, int[] fs) {
    if (ee == 0) {
      const gs = fs.group.array;
      const gsLen = cast(int)(gs.length);
      debug {
        writeln(p, " ", e, "; ", fs, " ", gs);
      }
      Mint prod = 1;
      foreach (i; 0 .. gsLen) {
        foreach (k; 0 .. gs[i][1]) {
          prod *= (pp[gs[i][1]] - pp[k]);
        }
        Mint tmp = 1;
        tmp *= pp[(gs[i][0] - 1) * gs[i][1]];
        foreach (j; 0 .. gsLen) {
          if (i != j) {
            tmp *= pp[min(gs[i][0], gs[j][0]) * gs[j][1]];
          }
        }
        prod *= tmp^^gs[i][1];
      }
      debug {
        writeln("  prod = ", prod);
      }
      ret += prod.inv;
      return;
    }
    foreach (f; 1 .. min(ee, last) + 1) {
      dfs(ee - f, f, fs ~ f);
    }
  }
  dfs(e, e, []);
  return ret;
}

void main() {
  try {
    for (; ; ) {
      const M = readInt();
      
      Mint ans = 1;
      foreach (i; 1 .. M + 1) {
        ans *= i;
      }
      
      int m = M;
      for (int p = 2; p^^2 <= m; ++p) {
        if (m % p == 0) {
          int e;
          do {
            ++e;
            m /= p;
          } while (m % p == 0);
          ans *= solve(p, e);
        }
      }
      if (m > 1) {
        ans *= solve(m, 1);
      }
      
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}
0