#758526 (D) No.1931 Fraction 2

提出ソース

結果

問題	No.1931 Fraction 2
ユーザー	👑 hos.lyric
提出日時	2022-05-06 21:31:16
言語	D (dmd 2.107.1)
結果	AC
実行時間	405 ms / 2,000 ms
コード長	5,140 bytes
コンパイル時間	1,881 ms
コンパイル使用メモリ	155,160 KB
実行使用メモリ	18,268 KB
最終ジャッジ日時	2023-09-04 17:00:26
合計ジャッジ時間	13,054 ms
ジャッジサーバーID （参考情報）	judge14 / judge11

このコードへのチャレンジ（β）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	8 ms 9,248 KB
testcase_01	AC	8 ms 8,200 KB
testcase_02	AC	8 ms 8,980 KB
testcase_03	AC	9 ms 8,436 KB
testcase_04	AC	10 ms 8,004 KB
testcase_05	AC	9 ms 7,880 KB
testcase_06	AC	10 ms 8,556 KB
testcase_07	AC	9 ms 7,932 KB
testcase_08	AC	9 ms 8,436 KB
testcase_09	AC	10 ms 7,992 KB
testcase_10	AC	9 ms 9,020 KB
testcase_11	AC	9 ms 8,184 KB
testcase_12	AC	9 ms 8,176 KB
testcase_13	AC	85 ms 12,868 KB
testcase_14	AC	271 ms 15,132 KB
testcase_15	AC	129 ms 13,380 KB
testcase_16	AC	29 ms 10,824 KB
testcase_17	AC	37 ms 11,296 KB
testcase_18	AC	364 ms 15,992 KB
testcase_19	AC	365 ms 16,032 KB
testcase_20	AC	363 ms 16,060 KB
testcase_21	AC	364 ms 16,028 KB
testcase_22	AC	363 ms 17,232 KB
testcase_23	AC	364 ms 16,036 KB
testcase_24	AC	367 ms 15,772 KB
testcase_25	AC	364 ms 17,532 KB
testcase_26	AC	368 ms 16,036 KB
testcase_27	AC	365 ms 16,040 KB
testcase_28	AC	401 ms 16,776 KB
testcase_29	AC	405 ms 17,748 KB
testcase_30	AC	402 ms 18,268 KB
testcase_31	AC	402 ms 17,488 KB
testcase_32	AC	400 ms 17,748 KB
testcase_33	AC	403 ms 18,048 KB
testcase_34	AC	397 ms 17,800 KB
testcase_35	AC	404 ms 18,020 KB
testcase_36	AC	403 ms 16,880 KB
testcase_37	AC	403 ms 16,888 KB
testcase_38	AC	8 ms 7,912 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

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

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


// a^-1 (mod m)
long modInv(long a, long m)
in {
  assert(m > 0, "modInv: m > 0 must hold");
}
do {
  long b = m, x = 1, y = 0, t;
  for (; ; ) {
    t = a / b; a -= t * b;
    if (a == 0) {
      assert(b == 1 || b == -1, "modInv: gcd(a, m) != 1");
      if (b == -1) y = -y;
      return (y < 0) ? (y + m) : y;
    }
    x -= t * y;
    t = b / a; b -= t * a;
    if (b == 0) {
      assert(a == 1 || a == -1, "modInv: gcd(a, m) != 1");
      if (a == -1) x = -x;
      return (x < 0) ? (x + m) : x;
    }
    y -= t * x;
  }
}


enum LIM = 2 * 10^^5 + 10;
int[] lpf;

void main() {
  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];
      auto B = new int[N];
      foreach (i; 0 .. N) {
        A[i] = readInt;
        B[i] = readInt;
      }
      
      auto es = new int[LIM];
      auto iss = new int[][LIM];
      foreach (i; 0 .. N) {
        for (int b = B[i]; b > 1; ) {
          const p = lpf[b];
          int e;
          do {
            ++e;
            b /= p;
          } while (b % p == 0);
          chmax(es[p], e);
          iss[p] ~= i;
        }
      }
      
      Mint denom = 1;
      foreach (p; 2 .. LIM) if (es[p] > 0) {
        const pe = p^^es[p];
        long sum;
        foreach (i; iss[p]) {
          long q = pe;
          int b = B[i];
          do {
            q /= p;
            b /= p;
          } while (b % p == 0);
          q *= A[i];
          q %= pe;
          q *= modInv(b, pe);
          sum += q;
          sum %= pe;
        }
        debug {
          writeln(p, ": ", pe, " ", sum);
        }
        int e = es[p];
        for (; e > 0 && sum % p == 0; --e, sum /= p) {}
        denom *= p^^e;
      }
      
      Mint val;
      foreach (i; 0 .. N) {
        val += Mint(A[i]) / Mint(B[i]);
      }
      const numer = val * denom;
      
      writeln(numer, " ", denom);
    }
  } catch (EOFException e) {
  }
}

yukicoder

結果

テストケース

ソースコード