結果
問題 | No.1611 Minimum Multiple with Double Divisors |
ユーザー | wolgnik |
提出日時 | 2021-07-21 23:18:30 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 1,493 ms / 2,000 ms |
コード長 | 1,871 bytes |
コンパイル時間 | 590 ms |
コンパイル使用メモリ | 82,656 KB |
実行使用メモリ | 77,576 KB |
最終ジャッジ日時 | 2024-04-14 05:25:57 |
合計ジャッジ時間 | 28,354 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1,493 ms
77,448 KB |
testcase_01 | AC | 1,352 ms
77,116 KB |
testcase_02 | AC | 1,360 ms
77,256 KB |
testcase_03 | AC | 1,340 ms
76,904 KB |
testcase_04 | AC | 1,346 ms
77,368 KB |
testcase_05 | AC | 1,339 ms
77,160 KB |
testcase_06 | AC | 1,350 ms
77,208 KB |
testcase_07 | AC | 1,354 ms
76,948 KB |
testcase_08 | AC | 1,349 ms
76,916 KB |
testcase_09 | AC | 1,360 ms
76,968 KB |
testcase_10 | AC | 961 ms
77,576 KB |
testcase_11 | AC | 989 ms
76,992 KB |
testcase_12 | AC | 968 ms
77,192 KB |
testcase_13 | AC | 971 ms
77,060 KB |
testcase_14 | AC | 963 ms
76,756 KB |
testcase_15 | AC | 957 ms
76,664 KB |
testcase_16 | AC | 976 ms
77,212 KB |
testcase_17 | AC | 960 ms
76,972 KB |
testcase_18 | AC | 978 ms
76,824 KB |
testcase_19 | AC | 85 ms
75,828 KB |
testcase_20 | AC | 82 ms
74,316 KB |
testcase_21 | AC | 91 ms
76,860 KB |
testcase_22 | AC | 81 ms
73,720 KB |
testcase_23 | AC | 84 ms
75,176 KB |
testcase_24 | AC | 91 ms
76,624 KB |
testcase_25 | AC | 84 ms
74,640 KB |
testcase_26 | AC | 91 ms
76,432 KB |
testcase_27 | AC | 90 ms
76,736 KB |
testcase_28 | AC | 43 ms
58,500 KB |
testcase_29 | AC | 39 ms
53,496 KB |
testcase_30 | AC | 44 ms
60,512 KB |
testcase_31 | AC | 46 ms
61,080 KB |
testcase_32 | AC | 43 ms
60,624 KB |
testcase_33 | AC | 45 ms
61,768 KB |
testcase_34 | AC | 43 ms
61,152 KB |
testcase_35 | AC | 45 ms
60,216 KB |
testcase_36 | AC | 41 ms
59,868 KB |
testcase_37 | AC | 43 ms
60,372 KB |
testcase_38 | AC | 45 ms
60,952 KB |
ソースコード
import sys input = sys.stdin.readline class sieve: def __init__(self, n): self.n = n self.sv = [1] * (n + 1) self.sv[0] = 0 self.sv[1] = 0 self.minp = [n] * (n + 1) for i in range(2, n + 1): if self.sv[i]: self.minp[i] = i for j in range(i * 2, n + 1, i): self.sv[j] = 0 self.minp[j] = min(self.minp[j], i) def isprime(self, x): if x > self.n: return False return self.sv[x] == 1 def factorize(self, x): if self.sv[x]: return [(x, 1)] res = [] while x > 1: p = self.minp[x] c = 0 while x % p == 0: x //= p c += 1 res.append((p, c)) return res def modlcm(self, a, mod): res = [0] * (self.n + 1) ex = set() for i in range(len(a)): f = self.factorize(a[i]) for j in f: if j > self.n: ex.add(j) continue res[j] = max(f.count(j), res[j]) rres = 1 for i in range(self.n + 1): if res[i] != 0: rres *= pow(i, res[i], mod) rres %= mod for i in ex: rres *= i rres %= mod return rres sv = sieve(10 ** 2) primes = [] for x in range(100): if sv.isprime(x): primes.append(x) for _ in range(int(input())): x = int(input()) res = 10 ** 15 for p in primes: if x % p: res = min(res, x * p) else: t = x c = 0 while t % p == 0: t //= p c += 1 res = min(res, x * p ** (c + 1)) #print(res, p, c) #print(res) for d in range(2, 33): z = 1. for p in primes: if p > d: break if d % p or x % p: continue cx = 0 cd = 0 t = x while t % p == 0: t //= p cx += 1 t = d while t % p == 0: t //= p cd += 1 z *= (cx + cd + 1) / (cx + 1) if z == 2.: res = min(res, x * d) print(res)