This documentation is automatically generated by online-judge-tools/verification-helper
# verification-helper: PROBLEM https://judge.yosupo.jp/problem/enumerate_primes
from pathlib import Path
import sys
sys.path.append(str(Path(__file__).resolve().parent.parent.parent.parent))
def EnumeratePrimes(n):
if n <= 1:
return []
A = [1, 7, 11, 13, 17, 19, 23, 29]
thres = (n + 29) // 30
sieve = [255] * (thres + int(n**0.5) + 10)
def ntoi(i):
return (i >> 2) + (not (~i & 19))
sieve[0] ^= 1
i = 0
flg = 1
while flg:
if sieve[i] != 0:
for j in range(8):
if sieve[i] >> j & 1:
p = i * 30 + A[j]
if p * p > n:
flg = 0
continue
q = [0] * 8
r = [0] * 8
s = 0
for k in range(8):
x = p * (i * 30 + A[k])
q[k] = x // 30
r[k] = ntoi(x - 30 * q[k])
while q[0] + s < thres:
sieve[q[0] + s] &= ~(1 << r[0])
sieve[q[1] + s] &= ~(1 << r[1])
sieve[q[2] + s] &= ~(1 << r[2])
sieve[q[3] + s] &= ~(1 << r[3])
sieve[q[4] + s] &= ~(1 << r[4])
sieve[q[5] + s] &= ~(1 << r[5])
sieve[q[6] + s] &= ~(1 << r[6])
sieve[q[7] + s] &= ~(1 << r[7])
s += p
i += 1
primes = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29]
for i in range(1, thres):
for j in range(8):
if sieve[i] >> j & 1:
primes.append(i * 30 + A[j])
while primes[-1] > n:
primes.pop()
return primes
n, a, b = map(int, input().split())
primes = EnumeratePrimes(n)
le = len(primes)
ans = []
for i in range(b, le, a):
ans.append(primes[i])
print(le, len(ans))
print(*ans)Traceback (most recent call last):
File "/opt/hostedtoolcache/Python/3.11.4/x64/lib/python3.11/site-packages/onlinejudge_verify/documentation/build.py", line 81, in _render_source_code_stat
bundled_code = language.bundle(
^^^^^^^^^^^^^^^^
File "/opt/hostedtoolcache/Python/3.11.4/x64/lib/python3.11/site-packages/onlinejudge_verify/languages/python.py", line 108, in bundle
raise NotImplementedError
NotImplementedError