AcWing 3792. 质数问题
原题链接
简单
作者:
SeiunSky
,
2023-03-12 15:18:24
,
所有人可见
,
阅读 103
Py3 代码
from collections import defaultdict as dd
T = int(input())
def sieve(n, k):
st = dd(bool)
primes = []
for i in range(2, n + 1):
if not st[i]:
primes.append(i)
for j in primes:
if j * i <= n:
st[j * i] = True
if i % j == 0:
break
cnt = 0
for prime in primes:
for j in range(len(primes) - 1):
if primes[j] + primes[j + 1] + 1 == prime:
cnt += 1
print("YES") if cnt >= k else print("NO")
for _ in range(T):
n, k = map(int, input().split())
sieve(n, k)