返回100内的素数列表

源码：

def prime_numbers():
	lst = []
	for x in xrange(2,100):
		for y in xrange(2,x/2 + 1):
			if x % y == 0:
				lst.append(x)
	return [n for n in xrange(2,100) if n not in lst]

print prime_numbers()

运行结果：

>>> 
[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]