Project Euler Problem 52 (C++和Python)

100 篇文章 3 订阅
87 篇文章 1 订阅

Problem 52: Permuted multiples

It can be seen that the number, 125874, and its double, 251748, contain exactly the same digits, but in a different order.

Find the smallest positive integer, x, such that 2x, 3x, 4x, 5x, and 6x, contain the same digits.

C++ source code

#include <iostream>
#include <set>
#include <cassert>

using namespace std;

class PE0052
{
public:
    set<int> getDigits(int x, int multiple);
    void findSmallestPositiveInteger();
};

set<int> PE0052::getDigits(int x, int multiple)
{
    set<int> digits_s;

    x *= multiple;
    while(x> 0)
    {
        digits_s.insert(x % 10);
        x /= 10; 
    }

    return digits_s;
}

void PE0052::findSmallestPositiveInteger()
{
    for (int n=100000; n<1000000; n++) 
    {
        if ((getDigits(n, 1) == getDigits(n, 2)) && 
            (getDigits(n, 2) == getDigits(n, 3)) &&
            (getDigits(n, 3) == getDigits(n, 4)) &&
            (getDigits(n, 4) == getDigits(n, 5)) &&
            (getDigits(n, 5) == getDigits(n, 6)))
        {
            cout << "The smallest positive integer " << n << ", x, ";
            cout << "2x, 3x, 4x, 5x and 6x, contain the same digits." << endl;
            break;
        }
    }
}

int main()
{
    PE0052 pe0052;

    assert(pe0052.getDigits(125874,1)==pe0052.getDigits(125874,2));

    pe0052.findSmallestPositiveInteger();
        
    return 0;
}

Python source code

def getDigitsString(x, multiple):
    return sorted(str(multiple*x))

def findSmallestPositiveInteger():
    for x in range(10**5, 10**6):
        if getDigitsString(x, 1) == getDigitsString(x, 2) and \
           getDigitsString(x, 2) == getDigitsString(x, 3) and \
           getDigitsString(x, 3) == getDigitsString(x, 4) and \
           getDigitsString(x, 4) == getDigitsString(x, 5) and \
           getDigitsString(x, 5) == getDigitsString(x, 6):
            return x
    return 0

def main():
    assert getDigitsString(125874, 1) == getDigitsString(125874, 2)
    print("The smallest integer",findSmallestPositiveInteger(),\
		  ", multiples from 1 to 6, contain the same digits.")

if  __name__ == '__main__':
    main()
    
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 1
    评论
评论 1
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值