結果

問題 No.3277 Forever Monotonic Number
ユーザー 👑 hos.lyric
提出日時 2025-09-19 21:51:48
言語 D
(dmd 2.109.1)
結果
AC  
実行時間 425 ms / 4,000 ms
コード長 4,544 bytes
コンパイル時間 2,096 ms
コンパイル使用メモリ 144,976 KB
実行使用メモリ 30,064 KB
最終ジャッジ日時 2025-09-19 21:51:54
合計ジャッジ時間 6,258 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 1
other AC * 9
権限があれば一括ダウンロードができます

ソースコード

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(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;


enum MAX_N = 10L^^14;

bool check(long a) {
  if (a < 10) return true;
  long sum, last = 10;
  for (long b = a; b; b /= 10) {
    const r = b % 10;
    sum += r;
    if (r > last) return false;
    last = r;
  }
  return check(sum);
}

void main() {
  long[] A;
  A ~= 0;
  for (int u = 0; u < A.length; ++u) {
    const a = A[u];
    foreach (e; max(a % 10, 1) .. 10) {
      const b = a * 10 + e;
      if (b <= 9 * (MAX_N + 1)) {
        A ~= b;
      }
    }
  }
  stderr.writeln("|A| = ", A.length);
  
  long[] B;
  foreach (a; A) if (a >= 1) {
    if (check(a)) B ~= a;
  }
  stderr.writeln("|B| = ", B.length);
  
  foreach (u; 0 .. cast(int)(B.length)) {
    if (9 * B[u] < B[u + 1]) {
      stderr.writefln("FAIL %s %s", B[u], B[u + 1]);
    }
    if (B[u] >= MAX_N + 1) break;
  }
  
  try {
    for (; ; ) {
      const numCases = readInt;
      foreach (caseId; 0 .. numCases) {
        const N = readLong;
        
        const n = N + 1;
        const b = B[B.lowerBound(n)];
        debug writefln("N = %s: b = %s", N, b);
        
        assert(b <= 9 * n);
        const q = (b - n) / 8;
        const r = (b - n) % 8;
        Mint ans;
        void add(long e, long a) {
          ans *= Mint(10)^^e;
          ans += (Mint(10)^^e - 1) / 9 * a;
        }
        add(n - q - (r?1:0), 1);
        if (r) add(1, 1 + r);
        add(q, 9);
        writeln(ans);
      }
    }
  } catch (EOFException e) {
  }
}
0