# 素数求法:
i = 2
prime_number = []
while i < 1001:
j = 2
while j <= i:
if i == j:
prime_number.append(i)
# print(i)
if i % j == 0:
break
j += 1
i += 1
print("1000以内的素数个数:", len(prime_number))
print(prime_number)
1000以内的素数个数:168个