描述如題：求解100以內的所有素數 

最古老的方法：

result = []
for i in range(2,101):
	j = 2
	flag = True
	while j<i and flag:
		if i%j==0:
			flag = False
		j=j+1
	if flag:
		result.append(str(i))
print(' '.join(result))

is_prime = [1]*101
is_prime[0] = is_prime[1] = 0
result = list()
for i in range(2,101):
	if is_prime[i]:
		result.append(str(i))
		j = i*i 
		while j<101:
			is_prime[j] = 0
			j+=i 
print(' '.join(result)) 
 

def gongyueshu(a,b):
	while b:
		a,b = b,a%b
	return a
print(gongyueshu(a,b))

def gongyueshu(a,b):
	while b:
		a,b = b,a%b
	return a
print(a*b/gongyueshu(a,b))

temp = 0
for i in range(len(L)):
	j = 0
	while i+j<=len(L):
		if sum(L[i:i+j])>temp:
			temp = sum(L[i:i+j])
		j+=1
print temp
 

print (a.lower())

if 'LOVE' in a.upper():
	print 'LOVE'
else:
	print 'SINGLE'

print(''.join([chr(97+(ord(a[i])-97+b)%26) for i in range(len(a))]))