結果
問題 | No.1339 循環小数 |
ユーザー |
👑 |
提出日時 | 2021-01-15 21:26:19 |
言語 | D (dmd 2.109.1) |
結果 |
AC
|
実行時間 | 85 ms / 2,000 ms |
コード長 | 2,525 bytes |
コンパイル時間 | 771 ms |
コンパイル使用メモリ | 124,416 KB |
実行使用メモリ | 6,944 KB |
最終ジャッジ日時 | 2024-06-22 10:35:28 |
合計ジャッジ時間 | 2,634 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 1 |
other | AC * 36 |
ソースコード
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)); }void main() {try {for (; ; ) {const numCases = readInt();foreach (caseId; 0 .. numCases) {long N = readLong();for (; N % 2 == 0; N /= 2) {}for (; N % 5 == 0; N /= 5) {}long phi = N;{long n = N;for (long p = 2; p^^2 <= n; ++p) {if (n % p == 0) {do {n /= p;} while (n % p == 0);phi = phi / p * (p - 1);}}if (n > 1) {phi = phi / n * (n - 1);}}debug {writeln("phi = ", phi);}long[] ds;for (long d = 1; d^^2 <= phi; ++d) {if (phi % d == 0) {ds ~= d;if (d != phi / d) {ds ~= phi / d;}}}ds.sort;long power(long a, long e) {long x = a % N, y = 1 % N;for (; e; e >>= 1) {if (e & 1) y = (y * x) % N;x = (x * x) % N;}return y;}long ans = phi;foreach (d; ds) {if ((power(10, d) - 1) % N == 0) {ans = d;break;}}writeln(ans);}}} catch (EOFException e) {}}