13,871
社区成员




int start = 1234, end = 9876543;
int n[8],m[8],t, num,num2, sum;
int i , j, k ;
for (i = start; i <= end; i++)
{
//分解
num = 0;
t = i;
while(t >= 1)
{
n[num++] = t % 10;
t /= 10;
}
//查重
bool bFind = false;
for(j = 0; j < num-1; j++)
{
for (k = j + 1; k < num; k++)
{
if (n[k] == n[j])
{
bFind = true;
j = num;
break;
}
}
}
if (bFind) continue;
//相乘
int nSame = 0;
for (j = 1; j <= num; j++)
{
sum = i * j;
num2 = 0;
t = sum;
while(t >= 1)
{
m[num2++] = t % 10;
t /= 10;
}
if (num2 > num) break;
//查同
int nFind = 0;
for (k = 0; k < num; k++)
{
for (int l = 0; l < num; l++)
{
if (m[l] == n[k])
{
nFind++;
break;
}
}
}
if (nFind == num)
{
nSame++;
}
else break;
}
if (nSame == num)
{
ShowMessage(IntToStr(i));
}
}
ShowMessage("没了");