結果

問題 No.1411 Hundreds of Conditions Sequences
ユーザー 👑 hos.lyrichos.lyric
提出日時 2021-02-26 21:34:38
言語 D
(dmd 2.105.2)
結果
AC  
実行時間 326 ms / 2,000 ms
コード長 5,273 bytes
コンパイル時間 1,607 ms
コンパイル使用メモリ 153,780 KB
実行使用メモリ 57,880 KB
最終ジャッジ日時 2023-09-04 12:14:50
合計ジャッジ時間 27,390 ms
ジャッジサーバーID
(参考情報)
judge13 / judge12
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 193 ms
50,736 KB
testcase_01 AC 190 ms
53,228 KB
testcase_02 AC 189 ms
50,736 KB
testcase_03 AC 190 ms
53,432 KB
testcase_04 AC 188 ms
50,740 KB
testcase_05 AC 189 ms
51,280 KB
testcase_06 AC 188 ms
50,780 KB
testcase_07 AC 187 ms
50,964 KB
testcase_08 AC 189 ms
50,768 KB
testcase_09 AC 190 ms
53,724 KB
testcase_10 AC 190 ms
50,680 KB
testcase_11 AC 188 ms
50,964 KB
testcase_12 AC 289 ms
53,456 KB
testcase_13 AC 268 ms
54,728 KB
testcase_14 AC 217 ms
52,208 KB
testcase_15 AC 267 ms
54,916 KB
testcase_16 AC 179 ms
50,832 KB
testcase_17 AC 265 ms
54,572 KB
testcase_18 AC 290 ms
53,428 KB
testcase_19 AC 298 ms
55,544 KB
testcase_20 AC 218 ms
51,676 KB
testcase_21 AC 306 ms
56,444 KB
testcase_22 AC 218 ms
51,804 KB
testcase_23 AC 287 ms
53,888 KB
testcase_24 AC 194 ms
50,480 KB
testcase_25 AC 293 ms
53,472 KB
testcase_26 AC 259 ms
52,752 KB
testcase_27 AC 218 ms
51,820 KB
testcase_28 AC 278 ms
53,028 KB
testcase_29 AC 187 ms
53,704 KB
testcase_30 AC 256 ms
52,508 KB
testcase_31 AC 231 ms
52,716 KB
testcase_32 AC 312 ms
54,644 KB
testcase_33 AC 313 ms
56,404 KB
testcase_34 AC 315 ms
54,656 KB
testcase_35 AC 310 ms
54,644 KB
testcase_36 AC 314 ms
54,656 KB
testcase_37 AC 310 ms
57,880 KB
testcase_38 AC 311 ms
54,644 KB
testcase_39 AC 308 ms
57,172 KB
testcase_40 AC 310 ms
54,684 KB
testcase_41 AC 303 ms
57,476 KB
testcase_42 AC 311 ms
54,660 KB
testcase_43 AC 306 ms
56,392 KB
testcase_44 AC 311 ms
54,684 KB
testcase_45 AC 305 ms
55,508 KB
testcase_46 AC 313 ms
54,640 KB
testcase_47 AC 308 ms
56,356 KB
testcase_48 AC 326 ms
54,644 KB
testcase_49 AC 320 ms
56,728 KB
testcase_50 AC 310 ms
54,644 KB
testcase_51 AC 315 ms
54,676 KB
testcase_52 AC 314 ms
54,664 KB
testcase_53 AC 305 ms
54,968 KB
testcase_54 AC 304 ms
54,664 KB
testcase_55 AC 307 ms
54,652 KB
testcase_56 AC 303 ms
54,660 KB
testcase_57 AC 307 ms
54,736 KB
testcase_58 AC 294 ms
54,792 KB
testcase_59 AC 300 ms
54,608 KB
testcase_60 AC 293 ms
54,688 KB
testcase_61 AC 302 ms
54,884 KB
testcase_62 AC 258 ms
57,756 KB
testcase_63 AC 276 ms
54,776 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;
  
  auto lpf = iota(LIM).array;
  foreach (p; 2 .. LIM) {
    if (lpf[p] == p) {
      for (int n = 2 * p; n < LIM; n += p) {
        chmin(lpf[n], p);
      }
    }
  }
  
  try {
    for (; ; ) {
      const N = readInt();
      auto A = new int[N];
      foreach (i; 0 .. N) {
        A[i] = readInt();
      }
      
      Mint prodAll = 1;
      foreach (i; 0 .. N) {
        prodAll *= A[i];
      }
      
      auto ess = new int[][](LIM, 2);
      foreach (i; 0 .. N) {
        for (int a = A[i]; a > 1; ) {
          const p = lpf[a];
          int e;
          do {
            ++e;
            a /= p;
          } while (a % p == 0);
          foreach (k; 0 .. 2) {
            if (ess[p][k] < e) {
              swap(ess[p][k], e);
            }
          }
        }
      }
      debug {
        foreach (p; 2 .. 30) {
          if (lpf[p] == p) {
            writeln(p, ": ", ess[p]);
          }
        }
      }
      
      Mint lcmAll = 1;
      foreach (p; 2 .. LIM) {
        foreach (_; 0 .. ess[p][0]) {
          lcmAll *= p;
        }
      }
      foreach (i; 0 .. N) {
        Mint prod = prodAll;
        prod *= inv[A[i]];
        Mint lcm = lcmAll;
        for (int a = A[i]; a > 1; ) {
          const p = lpf[a];
          int e;
          do {
            ++e;
            a /= p;
          } while (a % p == 0);
          if (ess[p][0] == e) {
            debug {
              writefln("divide by %s^(%s-%s)", p, ess[p][0], ess[p][1]);
            }
            foreach (_; 0 .. e - ess[p][1]) {
              lcm *= inv[p];
            }
          }
        }
        debug {
          writeln(i, " ", A[i], ": ", prod, " ", lcm);
        }
        const ans = prod - lcm;
        writeln(ans);
      }
    }
  } catch (EOFException e) {
  }
}
0