結果
問題 | No.1666 累乗数 |
ユーザー | 👑 hos.lyric |
提出日時 | 2021-09-03 22:26:26 |
言語 | D (dmd 2.107.1) |
結果 |
AC
|
実行時間 | 194 ms / 2,000 ms |
コード長 | 3,129 bytes |
コンパイル時間 | 720 ms |
コンパイル使用メモリ | 108,500 KB |
実行使用メモリ | 4,384 KB |
最終ジャッジ日時 | 2023-09-04 13:53:13 |
合計ジャッジ時間 | 5,031 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge11 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
4,376 KB |
testcase_01 | AC | 17 ms
4,380 KB |
testcase_02 | AC | 26 ms
4,380 KB |
testcase_03 | AC | 30 ms
4,380 KB |
testcase_04 | AC | 33 ms
4,380 KB |
testcase_05 | AC | 194 ms
4,380 KB |
testcase_06 | AC | 194 ms
4,380 KB |
testcase_07 | AC | 194 ms
4,380 KB |
testcase_08 | AC | 194 ms
4,376 KB |
testcase_09 | AC | 87 ms
4,380 KB |
testcase_10 | AC | 95 ms
4,376 KB |
testcase_11 | AC | 96 ms
4,384 KB |
testcase_12 | AC | 97 ms
4,380 KB |
testcase_13 | AC | 188 ms
4,376 KB |
testcase_14 | AC | 188 ms
4,376 KB |
testcase_15 | AC | 189 ms
4,380 KB |
testcase_16 | AC | 190 ms
4,380 KB |
testcase_17 | AC | 137 ms
4,380 KB |
testcase_18 | AC | 153 ms
4,380 KB |
testcase_19 | AC | 152 ms
4,380 KB |
ソースコード
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)); } // floor(a^(1/k)) ulong floorKthRoot(ulong a, ulong k) { import core.bitop : bsr; import std.algorithm : min; if (a == 0) { return 0; } else if (k <= 1) { return a; } else if (k == 2) { ulong b = a, x = 0, y = 0; for (int e = bsr(a) & ~1; e >= 0; e -= 2) { x <<= 1; y <<= 1; if (b >= (y | 1) << e) { b -= (y | 1) << e; x |= 1; y += 2; } } return x; } else if (k <= 40) { // min x s.t. x^k >= 2^64 enum ulong[] HIS = [0, 0, 4294967296UL, 2642246, 65536, 7132, 1626, 566, 256, 139, 85, 57, 41, 31, 24, 20, 16, 14, 12, 11, 10, 9, 8, 7, 7, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4]; ulong lo = 1UL << (bsr(a) / k); ulong hi = min(1UL << (bsr(a) / k + 1), HIS[cast(size_t)(k)]); for (; lo + 1 < hi; ) { const ulong mid = (lo + hi) / 2; ulong b = mid * mid; foreach (i; 2 .. k) b *= mid; ((b <= a) ? lo : hi) = mid; } return lo; } else if (k <= 63) { return ((1UL << k) <= a) ? 2 : 1; } else { return 1; } } enum LIM = 100; void main() { auto lpf = iota(LIM).array; auto moe = new int[LIM]; moe[1 .. $] = 1; foreach (p; 2 .. LIM) { if (lpf[p] == p) { for (int n = p; n < LIM; n += p) { chmin(lpf[n], p); moe[n] = (n / p % p == 0) ? 0 : -moe[n]; } } } try { for (; ; ) { const numCases = readInt(); foreach (caseId; 0 .. numCases) { const K = readLong(); long lo = 0, hi = K^^2; for (; lo + 1 < hi; ) { const mid = (lo + hi) / 2; long sum = 1; for (int k = 2; ; ++k) { const res = floorKthRoot(mid, k); if (res <= 1) { break; } sum -= moe[k] * (res - 1); } ((sum >= K) ? hi : lo) = mid; } writeln(hi); } } } catch (EOFException e) { } }