[백준 1418][Python] K-세준수

문제 링크 https://www.acmicpc.net/problem/1418

풀이

import sys
n = int(sys.stdin.readline())
m = int(sys.stdin.readline())

s = [0 for i in range(n+1)]
for i in range(2, n+1):
    if s[i] == 0:
        for t in range(i, n+1, i):
            if t % i == 0:
                s[t] = max(s[t], i)
ans = 0
for i in s:
    if i <= m:
        ans += 1
print(ans-1)