判断101-200之间有多少个素数，并输出所有素数。

def is_prime(num):
    for i in range(2, num):
        if num % i:
            continue
        else:
            return True
    return False


if __name__ == '__main__':
    total = 0
    for j in range(101, 201):
        if not is_prime(j):
            print(j)
            total += 1
    print('The total is %d' % total)

程序源代码：

#!/usr/bin/python
# -*- coding: UTF-8 -*-

h = 0
leap = 1
from math import sqrt
from sys import stdout
for m in range(101,201):
    k = int(sqrt(m + 1))
    for i in range(2,k + 1):
        if m % i == 0:
            leap = 0
            break
    if leap == 1:
        print '%-4d' % m
        h += 1
        if h % 10 == 0:
            print ''
    leap = 1
print 'The total is %d' % h

以上实例输出结果为：

101 
103 
107 
109 
113 
127 
131 
137 
139 
149 

151 
157 
163 
167 
173 
179 
181 
191 
193 
197 

199 
The total is 21