Project Euler Problem 29

最新推荐文章于 2020-11-20 18:49:36 发布

wxinbeings

最新推荐文章于 2020-11-20 18:49:36 发布

阅读量126

点赞数

分类专栏： Project Euler 文章标签： Project Euler

本文链接：https://blog.csdn.net/wxinbeings/article/details/80259566

版权

56 篇文章 0 订阅

订阅专栏

Problem 29

Consider all integer combinations of a^b for 2 ≤ a ≤ 5 and 2 ≤ b ≤ 5:

2 ²=4, 2 ³=8, 2 ⁴=16, 2 ⁵=32
3 ²=9, 3 ³=27, 3 ⁴=81, 3 ⁵=243
4 ²=16, 4 ³=64, 4 ⁴=256, 4 ⁵=1024
5 ²=25, 5 ³=125, 5 ⁴=625, 5 ⁵=3125

If they are then placed in numerical order, with any repeats removed, we get the following sequence of 15 distinct terms:

4, 8, 9, 16, 25, 27, 32, 64, 81, 125, 243, 256, 625, 1024, 3125

How many distinct terms are in the sequence generated by a^b for 2 ≤ a ≤ 100 and 2 ≤ b ≤ 100?

# 由 a^b (2 ≤ a ≤ 100, 2 ≤ b ≤ 100)生成的数中，不重复的数有多少个？

set1 = set()
for a in range(2,101):
    for b in range(2,101):
        product = pow(a,b)
        set1.add(product)
print(len(set1))

结果：9183

关注