python 算法

 1. x = 0
	for i in range(1000):
	    if i%3==0 or i%5==0:
	        x+=i
	print(x)

 2. a = 1
	b = 2
	s = 0
	while b <= 4000000:
	    if b % 2 ==0:
	        s += b
	    b,a = a+b,b
	print(s)

3. def fs(n):
    for i in range(2,int(n**0.5+1)):
        if n%i==0:
            return False
    else:
        return True

n = 600851475143
s = []
for i in range(2,int(n**0.5+1)):
    if n%i == 0:
        if fs(i):
            s.append(i)
        if fs(n//i):
            s.append(n // i)

print(max(s))