Project Euler Problem 33_project euler 33-CSDN博客

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

本文探讨了一类有趣的分数，即通过取消分子与分母中相同的数字来简化分数的情况。特别关注的是那些非平凡例子，其值小于1且由两位数组成的分子与分母。文章的目标是找出所有符合条件的分数，并计算这些分数乘积的最简形式中的分母值。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Problem 33

Digit cancelling fractions

The fraction ⁴⁹/₉₈ is a curious fraction, as an inexperienced mathematician in attempting to simplify it may incorrectly believe that ⁴⁹/₉₈ = ⁴/₈, which is correct, is obtained by cancelling the 9s.

We shall consider fractions like, ³⁰/₅₀ = ³/₅, to be trivial examples.

There are exactly four non-trivial examples of this type of fraction, less than one in value, and containing two digits in the numerator and denominator.

If the product of these four fractions is given in its lowest common terms, find the value of the denominator.

⁴⁹/₉₈是一个有趣的分数，因为缺乏经验的数学家可能在约简时错误地认为，等式⁴⁹/₉₈ = ⁴/₈之所以成立，是因为在分数线上下同时抹除了9的缘故。

我们也会想到，存在诸如³⁰/₅₀ = ³/₅这样的平凡解。

这类有趣的分数恰好有四个非平凡的例子，它们的分数值小于1，且分子和分母都是两位数。

将这四个分数的乘积写成最简分数，求此时分母的值。

# 思路：两个数组成的分数可以写作ij/jk=i/k ij/ki=j/k

for i in range(1,10):
    for j in range(1,10):
        for k in range(1,10):
            if (10*i+k)*j == (10*k+j)*i and i != k:
                print([10*i+k, 10*k+j])