1. 寫個程序,接受用戶輸入數字,並進行校驗,非數字給出錯誤提示,然後重新等待用戶輸入。
2. 根據用戶輸入數字,輸出從0到該數字之間所有的素數。(只能被1和自身整除的數爲素數)
num = int(num)
i = 2
is_prime = False
while i < num:
for ii in range(2, i):
if i % ii == 0:
is_prime = False
break
else:
is_prime = True
if is_prime:
print i, 'is prime'
i += 1
else:
break
===========================
2.
#!/usr/bin/env python
#author:liang
n = int(raw_input('please input a num: '))
def is_prime(n):
if n <= 1:
return False
i = 2
while i*i <= n:
if n % i == 0:
return False
i += 1
return True
print([j for j in range(2,n+1) if is_prime(j)])
==================================================
#!/usr/bin/env python
try:
num = int(raw_input('Please enter a number: '))
prime_number = [x for x in range(2,num+1) if not [y for y in range(2,x) if x % y == 0]]