欧拉习题38

qshbbh

于 2021-11-13 16:51:27 发布

阅读量879

点赞数

分类专栏： Euler习题 Matlab

本文链接：https://blog.youkuaiyun.com/newcloudtech/article/details/121306790

版权

MATLAB Euler

Matlab 同时被 2 个专栏收录

54 篇文章

订阅专栏

Euler习题

41 篇文章

订阅专栏

该博客内容涉及一个编程问题，目标是找到能够通过与1到n相乘并连接其结果得到的最大九位数1到9 pandigital数字。代码示例中，使用了MATLAB进行循环遍历，寻找符合条件的数字i，生成1到9的pandigital数字，并存储最大值。

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

题目如下：

Take the number 192 and multiply it by each of 1, 2, and 3:

192 × 1 = 192
192 × 2 = 384
192 × 3 = 576

By concatenating each product we get the 1 to 9 pandigital, 192384576. We will call 192384576 the concatenated product of 192 and (1,2,3)

The same can be achieved by starting with 9 and multiplying by 1, 2, 3, 4, and 5, giving the pandigital, 918273645, which is the concatenated product of 9 and (1,2,3,4,5).

What is the largest 1 to 9 pandigital 9-digit number that can be formed as the concatenated product of an integer with (1,2, ... , n) where n > 1?

代码如下：

clear;clc;close all
c = 1;
for i = 1 : 9999
    a = sprintf('%d',i.*(1:9));
    c = max(c,str2double(setdiff(unique(a(1:9),'stable'),'0','stable')));
end