|
发表于 2018-10-21 22:12:30
|
显示全部楼层
- import math
- count = 0
- for i in range(101,200):
- su = True
- for m in range(2,int(math.sqrt(i))+1):
- if i % m == 0:
- su = False
- break
- if su == True:
- count += 1
- print(i,end=',')
- print('\n一个有{}个素数'.format(count))
复制代码
另一种思路
- import math
- list1 = [ x for x in range(101,200)]
- list2 = []
- count= 0
- for n in range(101,200):
- for m in range(2,int(math.sqrt(n)+1)):
- if n % m ==0:
- list2.append(n)
- break
- for primenumber in list1:
- if primenumber not in list2:
- print(primenumber,end=',')
- count += 1
- print('\n素数的数量是:',count)
复制代码 |
|