Abstract: This script is used for hunting all even, odd, or prime numbers with a given scale.
The script:
#define the class
class hunt_numbers(object):
def __init__(self, start, end):
self.start = start
self.end = end
def even_numbers(self):
num=self.start
arr=[]
while num<=self.end:
if(num%2 == 0):
arr.append(num)
num=num+1
return arr
def odd_numbers(self):
num=self.start
arr=[]
while num<=self.end:
if(num%2 == 1):
arr.append(num)
num=num+1
return arr
def judge_prime(self, num):
found=1
for i in range(2,num):
if (num % i == 0) :
found=0
break
return found
def prime_numbers(self):
pool=range(self.start, self.end)
pool.append(self.end)
arr=[]
for index,num in enumerate(pool):
if (self.judge_prime(num)==1):
arr.append(num)
return arr
#main programs
#
a=hunt_numbers(100,240)
#hunt even numbers
e=a.even_numbers()
print 'even numbers:', e
#hunt odd numbers
o=a.odd_numbers()
print 'odd numbers:', o
#hunt prime numbers
p=a.prime_numbers()
print 'prime numbers:', p
class hunt_numbers(object):
def __init__(self, start, end):
self.start = start
self.end = end
def even_numbers(self):
num=self.start
arr=[]
while num<=self.end:
if(num%2 == 0):
arr.append(num)
num=num+1
return arr
def odd_numbers(self):
num=self.start
arr=[]
while num<=self.end:
if(num%2 == 1):
arr.append(num)
num=num+1
return arr
def judge_prime(self, num):
found=1
for i in range(2,num):
if (num % i == 0) :
found=0
break
return found
def prime_numbers(self):
pool=range(self.start, self.end)
pool.append(self.end)
arr=[]
for index,num in enumerate(pool):
if (self.judge_prime(num)==1):
arr.append(num)
return arr
#main programs
#
a=hunt_numbers(100,240)
#hunt even numbers
e=a.even_numbers()
print 'even numbers:', e
#hunt odd numbers
o=a.odd_numbers()
print 'odd numbers:', o
#hunt prime numbers
p=a.prime_numbers()
print 'prime numbers:', p
Writing date: 20150513
No comments:
Post a Comment