这是个人的Python代码练习作品,完成了在Python2.7版本下寻找质数方法的操作。
#!/usr/bin/python
# coding=utf8
# Find Primes
# Usage: ./findPrimes.py MAX
import sys
def findPrimes(max):
"""list findPrime(int max)
返回找到的质数组成的列表.
max为寻找的上限。"""
primes = [2]
for i in range(3, max):
for j in primes:
if i%j == 0:
break
else:
primes.append(i)
return primes
if __name__ == '__main__':
MAX = int(sys.argv[1])
print findPrimes(MAX)
exit(0)
寻找质数运能结果,如下
./findPrimes.py 200
[2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73,
79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163
, 167, 173, 179, 181, 191, 193, 197, 199]
#www.iplaypy.com
玩蛇网文章,转载请注明出处和文章网址:https://www.iplaypy.com/code/algorithm/a2403.html
相关文章 Recommend