結果
問題 |
No.3081 Make Palindromic Multiple
|
ユーザー |
👑 |
提出日時 | 2025-03-28 21:59:35 |
言語 | D (dmd 2.109.1) |
結果 |
AC
|
実行時間 | 12 ms / 1,000 ms |
コード長 | 2,223 bytes |
コンパイル時間 | 3,222 ms |
コンパイル使用メモリ | 147,468 KB |
実行使用メモリ | 7,324 KB |
最終ジャッジ日時 | 2025-03-28 21:59:40 |
合計ジャッジ時間 | 5,466 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 54 |
ソースコード
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)); } enum LIM = 10L^^18; void main() { try { for (; ; ) { const N = readLong; long M = N; int E2, E5; for (; M % 2 == 0; M /= 2) ++E2; for (; M % 5 == 0; M /= 5) ++E5; string s = (2L^^E2 * 5L^^E5).to!string; const E = max(cast(int)(s.length), E2, E5); s = '0'.repeat(E - cast(int)(s.length)).array.to!string ~ s; long phi = M; { long m = M; for (long p = 2; p * p <= m; ++p) if (m % p == 0) { do { m /= p; } while (m % p == 0); (phi /= p) *= (p - 1); } if (m > 1) (phi /= m) *= (m - 1); } const BigInt want = BigInt(10L^^E - 1) * BigInt(phi); const q = cast(long)(want / LIM); const r = cast(long)(want % LIM); const string[2] ss = [s.dup.reverse.to!string, s]; writeln(2 * (q + (r?1:0))); foreach (i; 0 .. 2) { foreach (j; 0 .. q) writeln(ss[i], " ", LIM); if (r) writeln(ss[i], " ", r); } } } catch (EOFException e) { } }