class Solution(object):
def isPrime(self, integer):
i=2
while i<integer:
if integer%i==0:
return False
else:
i+=1
return True
def printPrime(self,n,m):
list=[]
i=n
while i<=m:
if self.isPrime(i):
list.append(i)
i+=1
return list
if __name__ == "__main__":
n = 100
m = 200
answer = Solution()
print answer.printPrime(n,m)
近期评论