Submission #62798092

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
from math import sqrt
n,K=map(int,input().split())
a=list(map(int,input().split()))
b=[[] for i in range(n)]
s=[0 for i in range(max(a)+1)]
for i in range(n):
    for k in range(1,int(sqrt(a[i]))+1):
        if(a[i]%k==0):
            s[k]+=1
            s[a[i]//k]+=1
            b[i].append(k)
            b[i].append(a[i]//k)
    b[i].sort()
for i in range(n):
    for u in range(len(b[i])):
        if(s[b[i][-u-1]]>=K):
            print(b[i][-u-1])
            break
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

from math import sqrt
n,K=map(int,input().split())
a=list(map(int,input().split()))
b=[[] for i in range(n)]
s=[0 for i in range(max(a)+1)]


for i in range(n):
    for k in range(1,int(sqrt(a[i]))+1):
        if(a[i]%k==0):
            s[k]+=1
            s[a[i]//k]+=1
            b[i].append(k)
            b[i].append(a[i]//k)
    b[i].sort()

for i in range(n):
    for u in range(len(b[i])):
        if(s[b[i][-u-1]]>=K):
            print(b[i][-u-1])
            break

Submission Info

Judge Result