結果
問題 | No.2954 Calculation of Exponentiation |
ユーザー |
👑 |
提出日時 | 2024-11-08 22:07:12 |
言語 | D (dmd 2.109.1) |
結果 |
AC
|
実行時間 | 2 ms / 2,000 ms |
コード長 | 2,032 bytes |
コンパイル時間 | 3,134 ms |
コンパイル使用メモリ | 121,220 KB |
実行使用メモリ | 5,248 KB |
最終ジャッジ日時 | 2024-11-08 22:07:16 |
合計ジャッジ時間 | 3,498 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 28 |
コンパイルメッセージ
/home/linuxbrew/.linuxbrew/opt/dmd/include/dlang/dmd/std/numeric.d(2999): Warning: cannot inline function `std.numeric.gcdImpl!ulong.gcdImpl`
ソースコード
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)); }bool solve(long A, long B) {if (B == 0) return true;long p = A, q = 10^^4;{const g = gcd(p, q);p /= g;q /= g;}if (B < 0) {B = -B;swap(p, q);}long r = B, s = 10^^4;{const g = gcd(r, s);r /= g;s /= g;}// (p/q)^(r/s)if (q != 1) return false;long pp = p;for (long d = 2; d*d <= pp; ++d) if (pp % d == 0) {long e;do { ++e; pp /= d; } while (pp % d == 0);if (e % s != 0) return false;}if (pp > 1) if (1 % s != 0) return false;return true;}void main() {try {for (; ; ) {const A = cast(long)(round(1e4 * readToken.to!real));const B = cast(long)(round(1e4 * readToken.to!real));debug writeln(A, " ", B);const ans = solve(A, B);writeln(ans ? "Yes" : "No");}} catch (EOFException e) {}}