欧拉计划Problem 52

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.



#define N 1000000
#define M 10




bool check(int check1[],int check2[])
{
for (int i = 0; i < M; i++)
{
if (check1[i] != check2[i])
{
return false;
}
}
return true;
}


void number(int x,int check[])
{
for (;x != 0; x /= 10)
{
check[x%10] ++;
}
}


int main()
{
clock_t ts,te;
ts=clock();
int answer = 0;
int i,j;
int check1[M] = {0},check2[M] = {0};
for (i = 2; i < N; i++)
{
memset(check1,0,sizeof(check1));
number(i,check1);
for (j = 1; j < 7 ; j++)
{
memset(check2,0,sizeof(check2));
number(i*j,check2);
if (check(check1,check2) == false)
{
break;
}
}
if (j == 7)
{
answer = i;
break;
}

}
printf("\nanswer %d",answer);
te=clock();
printf("\ntime difference: %ds\n",(te-ts)/CLOCKS_PER_SEC);
getchar();
return 0;
}

  • 1
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值