結果
問題 |
No.2954 Calculation of Exponentiation
|
ユーザー |
![]() |
提出日時 | 2025-03-20 20:26:49 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 2,034 bytes |
コンパイル時間 | 206 ms |
コンパイル使用メモリ | 81,996 KB |
実行使用メモリ | 59,048 KB |
最終ジャッジ日時 | 2025-03-20 20:27:54 |
合計ジャッジ時間 | 2,162 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 27 WA * 1 |
ソースコード
import sys from math import gcd def factor(n): factors = {} if n <= 1: return factors while n % 2 == 0: factors[2] = factors.get(2, 0) + 1 n = n // 2 i = 3 max_i = int(n**0.5) + 1 while i <= max_i and n > 1: while n % i == 0: factors[i] = factors.get(i, 0) + 1 n = n // i max_i = int(n**0.5) + 1 i += 2 if n > 1: factors[n] = 1 return factors def parse_ruijou_A(s): if '.' in s: int_part, dec_part = s.split('.', 1) dec_part = dec_part.ljust(4, '0')[:4] else: int_part = s dec_part = '0000' int_val = int(int_part) dec_val = int(dec_part) numerator = int_val * 10000 + dec_val denominator = 10000 g = gcd(numerator, denominator) return numerator // g, denominator // g def parse_ruijou_B(s): s = s.strip() sign = 1 if s.startswith('-'): sign = -1 s = s[1:] if '.' in s: int_part, dec_part = s.split('.', 1) dec_part = dec_part.ljust(4, '0')[:4] else: int_part = s dec_part = '0000' int_val = int(int_part) dec_val = int(dec_part) numerator = int_val * 10000 + dec_val denominator = 10000 g = gcd(numerator, denominator) numer_reduced = numerator // g denom_reduced = denominator // g return (sign, numer_reduced, denom_reduced) def main(): A_str, B_str = sys.stdin.readline().split() a_num, a_den = parse_ruijou_A(A_str) sign_B, numer_B, denom_B = parse_ruijou_B(B_str) a, b = a_num, a_den e, f = numer_B, denom_B if sign_B == -1: a, b = b, a a_factors = factor(a) for prime in a_factors: if a_factors[prime] % f != 0: print("No") return b_factors = factor(b) for prime in b_factors: if b_factors[prime] % f != 0: print("No") return if b != 1: print("No") return print("Yes") if __name__ == '__main__': main()