Project Euler Problem 1
2016-10-07 16:23
405 查看
用python解决 Project Euler 问题 记录
由于比较擅长java 对python相对陌生,就用python来解答
源码:
sumAll =0
for index in range(1,1000):
if index%3==0 or index%5 ==0:
sumAll += index
print(sumAll)
由于比较擅长java 对python相对陌生,就用python来解答
源码:
sumAll =0
for index in range(1,1000):
if index%3==0 or index%5 ==0:
sumAll += index
print(sumAll)
相关文章推荐
- project euler Problem 15
- project euler Problem 39
- http://projecteuler.net/problem=20 [Answer:648]
- Project Euler Problem 25 :1000-digit Fibonacci number
- Project Euler Problem 7: 10001st prime
- Project Euler Problem 12: Highly divisible triangular number
- Project Euler Problem 16
- Project Euler -> problem 5
- Project Euler problem 63
- project euler problem 12
- Project euler problem 21 - 30
- project euler problem 25 大数连加Fibonacci序列
- Maximum path sum I [Project Euler.Problem 18]
- Project Euler Problem 17
- Project Euler problem 30
- Project Euler problem 41
- Project Euler Problem 3 - Largest prime factor
- project euler Problem 53
- Project Euler Problem 25
- project euler Problem 3