結果

問題 No.2989 Fibonacci Prize
ユーザー 👑 hos.lyric
提出日時 2024-12-14 00:21:48
言語 D
(dmd 2.109.1)
結果
AC  
実行時間 59 ms / 2,000 ms
コード長 4,761 bytes
コンパイル時間 1,785 ms
コンパイル使用メモリ 155,512 KB
実行使用メモリ 7,324 KB
最終ジャッジ日時 2024-12-14 00:21:54
合計ジャッジ時間 5,114 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 77
権限があれば一括ダウンロードができます

ソースコード

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; }
string COLOR(string s = "") { return "\x1b[" ~ s ~ "m"; }
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 {
  static int M;
  import std.conv : to;
  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; }
}
alias Mint = ModInt;
void main() {
  try {
    for (; ; ) {
      const N = readInt;
      const M = max(readLong, 2);
      Mint.M = N;
      
      long per;
      {
        Mint a = 0, b = 1;
        for (; ; ) {
          ++per;
          a += b;
          swap(a, b);
          if (a == Mint(0) && b == Mint(1)) break;
        }
      }
      debug writeln("per = ", per);
      
      auto fib = new Mint[per + 2];
      fib[0] = 0;
      fib[1] = 1;
      foreach (i; 2 .. per + 2) {
        fib[i] = fib[i - 1] + fib[i - 2];
      }
      debug if (N <= 50) writeln("fib = ", fib);
      
      const quo = (M + 1) / per;
      const rem = (M + 1) % per;
      auto fs = new long[N];
      foreach (i; 0 .. per) fs[fib[i].x] += quo;
      foreach (i; 0 .. rem) fs[fib[i].x] += 1;
      fs[0 % N] -= 1;
      fs[1 % N] -= 1;
      debug if (N <= 50) writeln("fs = ", fs);
      
      long ans;
      foreach (u; 0 .. N) ans += fs[u] * (fs[u] - 1) / 2;
      
      // fib[M]
      // fib[M-1]
      // fib[M-1] + fib[M-2]
      if (1 <= M     && !fib[ M      % per]) ans += 1;
      if (1 <= M - 1 && !fib[(M - 1) % per]) ans += 1;
      if (1 <= M - 2 && !fib[ M      % per]) ans += 1;
      
      writeln(ans);
      
      if (M <= 10) {
        auto F = new long[M + 1];
        F[0] = 0;
        F[1] = 1;
        foreach (i; 2 .. M + 1) F[i] = F[i - 1] + F[i - 2];
        long brt;
        foreach (l; 1 .. M + 1) foreach (r; l .. M + 1) {
          const sum = F[l .. r + 1].sum;
          if (sum % N == 0 && sum <= F[M]) {
            ++brt;
          }
        }
        assert(brt == ans, format("%s %s: %s %s", N, M, brt, ans));
      }
    }
  } catch (EOFException e) {
  }
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0