Problem 33 Digit cancelling fractions （暴力set+pair）

最新推荐文章于 2021-07-05 14:42:25 发布

LzyRapX

最新推荐文章于 2021-07-05 14:42:25 发布

阅读量676

点赞数 1

分类专栏： Project Euler ACM_STL题 ACM_暴力穷举文章标签： Problem 33 Digit cancelling fractions 暴力set+pair

本文链接：https://blog.csdn.net/liangzhaoyang1/article/details/52966439

版权

Project Euler 同时被 3 个专栏收录

81 篇文章 0 订阅

订阅专栏

ACM_暴力穷举

35 篇文章 0 订阅

订阅专栏

ACM_STL题

31 篇文章 0 订阅

订阅专栏

Digit cancelling fractions

Problem 33

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.

题解：暴力set + pair....

代码：

#include<bits/stdc++.h>
using namespace std;
int main()
{
    vector< pair<int,int> > s;
    for (int a=10;a<=98;a++)
    {
        for(int b=a+1;b<=99;b++)
        {
            if (a%10 == b/10)//分子个位==分母十位
            {
                if (b%10 != 0)
                {
                    if (a/(float)b == (a/10)/(float)(b%10) )//删除相同的数字后相等
                    {
                        pair<int,int> p(a,b);
                        s.push_back(p);
                    }
                }
            }
        }
    }
 
    int ans1=1,ans2=1; //分子和分母分别的乘积
    vector<pair<int,int> >::iterator it;
    for (it=s.begin(); it!=s.end();++it)
    {
        ans1 *= it->first;
        ans2 *= it->second;
    }

    int ans=__gcd(ans1,ans2);
    ans=ans2/ans;
    cout<<ans<<endl;
    return 0;
}