projecteuler Problem 29
2014-06-13 00:00
295 查看
def Judge(small,big): lsum=[] num=0 for i in range(small,big+1): for j in range(small,big+1): num=i**j if(lsum.count(num)==0): lsum.append(num) return len(lsum) print Judge(2,100)
相关文章推荐
- http://projecteuler.net/problem=29 [Answer:9183]
- projecteuler Problem 29
- Project Euler problem 29
- project euler Problem 3
- http://projecteuler.net/problem=21 [Answer:31626]
- http://projecteuler.net/problem=30 [Answer:443839]
- Project Euler -> problem 4
- Project Euler problem 61
- project euler problem 11:Largest product in a grid
- Maximum path sum I [Project Euler.Problem 18]
- Project Euler Problem 59
- project euler problem 32又是暴搜
- Project Euler Problem 32
- Project Euler Problem 7: 10001st prime
- Project Euler Problem 12: Highly divisible triangular number
- Project Euler problem 43
- Project Euler problem 53
- Project Euler Problem 75
- Project Euler Problem 32 Pandigital products
- Matlab 编程 Project Euler Problem 21 Amicable numbers