結果
問題 | No.1611 Minimum Multiple with Double Divisors |
ユーザー | NatsubiSogan |
提出日時 | 2021-08-14 12:37:51 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 1,091 ms / 2,000 ms |
コード長 | 1,344 bytes |
コンパイル時間 | 246 ms |
コンパイル使用メモリ | 82,404 KB |
実行使用メモリ | 78,516 KB |
最終ジャッジ日時 | 2024-04-15 10:10:11 |
合計ジャッジ時間 | 15,904 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1,091 ms
77,776 KB |
testcase_01 | AC | 498 ms
77,996 KB |
testcase_02 | AC | 516 ms
77,624 KB |
testcase_03 | AC | 502 ms
77,788 KB |
testcase_04 | AC | 529 ms
78,292 KB |
testcase_05 | AC | 523 ms
78,516 KB |
testcase_06 | AC | 524 ms
77,988 KB |
testcase_07 | AC | 504 ms
77,756 KB |
testcase_08 | AC | 511 ms
77,488 KB |
testcase_09 | AC | 519 ms
77,540 KB |
testcase_10 | AC | 338 ms
78,320 KB |
testcase_11 | AC | 368 ms
78,056 KB |
testcase_12 | AC | 374 ms
77,720 KB |
testcase_13 | AC | 373 ms
78,516 KB |
testcase_14 | AC | 367 ms
77,620 KB |
testcase_15 | AC | 371 ms
78,196 KB |
testcase_16 | AC | 371 ms
78,080 KB |
testcase_17 | AC | 379 ms
78,184 KB |
testcase_18 | AC | 359 ms
77,976 KB |
testcase_19 | AC | 126 ms
77,332 KB |
testcase_20 | AC | 132 ms
77,464 KB |
testcase_21 | AC | 128 ms
77,364 KB |
testcase_22 | AC | 131 ms
77,076 KB |
testcase_23 | AC | 129 ms
77,920 KB |
testcase_24 | AC | 126 ms
77,476 KB |
testcase_25 | AC | 123 ms
77,480 KB |
testcase_26 | AC | 135 ms
77,196 KB |
testcase_27 | AC | 130 ms
77,396 KB |
testcase_28 | AC | 52 ms
55,272 KB |
testcase_29 | AC | 54 ms
54,768 KB |
testcase_30 | AC | 52 ms
54,068 KB |
testcase_31 | AC | 54 ms
54,504 KB |
testcase_32 | AC | 49 ms
54,628 KB |
testcase_33 | AC | 53 ms
55,504 KB |
testcase_34 | AC | 51 ms
55,120 KB |
testcase_35 | AC | 52 ms
54,876 KB |
testcase_36 | AC | 52 ms
55,616 KB |
testcase_37 | AC | 52 ms
54,792 KB |
testcase_38 | AC | 52 ms
55,584 KB |
ソースコード
from collections import Counter import math def prime_numbers(x): if x < 2: return [] prime_numbers = [i for i in range(x)] prime_numbers[1] = 0 for prime_number in prime_numbers: if prime_number > math.sqrt(x): break if prime_number == 0: continue for composite_number in range(2 * prime_number, x, prime_number): prime_numbers[composite_number] = 0 return [prime_number for prime_number in prime_numbers if prime_number != 0] primes = prime_numbers(33) def soinnsuu(x): s = [] for i in primes: if i > int(math.sqrt(x)): break elif x % i == 0: while x % i == 0: x //= i s.append(i) if not x == 1 and x in primes: s.append(x) return s def main(): import sys input = sys.stdin.buffer.readline d2 = [Counter(soinnsuu(i)) for i in range(33)] for _ in range(int(input())): x = int(input()) d = Counter(soinnsuu(x)) cnt = 1 for k, v in d.items(): cnt *= v + 1 for i in range(2, 32): cnt2 = 1 for k in primes: cnt2 *= d[k] + d2[i][k] + 1 if cnt2 == cnt * 2: print(i * x) break if __name__ == '__main__': main()