Submission #64544527

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
def prime_list(sup):
    jdg = [0 for _ in range(sup + 1)]
    prms = []
    for i in range(2, sup + 1):
        if jdg[i] == 0:
            prms.append(i)
            for j in range(2 * i, sup + 1, i):
                jdg[j] += 1
    return prms
from sortedcontainers import SortedSet
plis = prime_list(10**6)
ss = SortedSet()
aa = len(plis)
for i in range(aa - 1):
    tmp = plis[i]
    while tmp * plis[i + 1] <= 10**6:
        for j in range(i + 1, aa):
            tmp2 = plis[j]
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

def prime_list(sup):
    jdg = [0 for _ in range(sup + 1)]
    prms = []
    for i in range(2, sup + 1):
        if jdg[i] == 0:
            prms.append(i)
            for j in range(2 * i, sup + 1, i):
                jdg[j] += 1
    return prms


from sortedcontainers import SortedSet

plis = prime_list(10**6)
ss = SortedSet()
aa = len(plis)
for i in range(aa - 1):
    tmp = plis[i]
    while tmp * plis[i + 1] <= 10**6:
        for j in range(i + 1, aa):
            tmp2 = plis[j]
            while tmp * tmp2 <= 10**6:
                ss.add(tmp * tmp2)
                tmp2 *= plis[j]
        tmp *= plis[i]
from math import isqrt

for _ in range(int(input())):
    a = int(input())
    idx=ss.bisect_right(isqrt(a))
    print(ss[idx-1]**2)

Submission Info

Judge Result