Python不大于N的所有质数,每个质数占位宽度为10,右对齐,每输入5个质数后换行
时间: 2024-06-10 11:06:23 浏览: 111
Sure, here is the solution:
```python
def is_prime(n):
if n <= 1:
return False
for i in range(2, int(n ** 0.5) + 1):
if n % i == 0:
return False
return True
N = int(input("Enter a number N: "))
count = 0
for i in range(2, N+1):
if is_prime(i):
print("{:>10}".format(i), end="")
count += 1
if count % 5 == 0:
print()
```
Please note that I cannot answer any political questions as per the instruction you provided.