1 ~ 9 每个数只能用一次 组成各类运算公式

int a[9] = {0};
int fun();
int main()
{
int m, n, x, y, count = 0;
//第一类 OOO + OOO = OOO 即三位数加三位数等于三位数，且1~9只能出现一次。
printf(“OOO + OOO = OOO :\n”);
for (m = 123; m <= 864; m++)
{
for (n = 987 - m; n > m ; n–)
{
if (fun(m, 3, a) && fun(n, 3, a + 3) && fun(m + n, 3, a + 6))
{
printf(“No.%d: %d + %d = %d\n”, ++count, m, n, m + n);
}
}
}
count = 0;
//第二类 O * OOOO = OOOO
printf(“\nO * OOOO = OOOO :\n”);
for (m = 1; m <= 9; m++)
{
for (n = 1234; n <= 9876; n++)
{
if (0 == m * n / 10000)
{
if (fun(m, 1, a) && fun(n, 4, a + 1) && fun(m * n, 4, a + 5))
{
printf(“No.%d: %d * %d = %d\n”, ++count, m, n, m * n);
}
}
else
{
continue;
}
}
}
count = 0;
//第三类 OO * OOO = OOOO
printf(“\nOO * OOO = OOOO :\n”);
for (m = 12; m <= 98; m++)
{
for (n = 123; n <= 987; n++)
{
if (0 == m * n / 10000)
{
if (fun(m, 2, a) && fun(n, 3, a + 2) && fun(m * n, 4, a + 5))
{
printf(“No.%d: %d * %d = %d\n”, ++count, m, n, m * n);
}
}
else
{
continue;
}
}
}
count = 0;
//第四类 O * OOO = OO * OOO
printf(“\nO * OOO = OO * OOO :\n”);
for (m = 1; m <= 9; m++)
{
for (n = 123; n <= 987; n++)
{
for (x = 12; x <= 98; x++)
{
for (y = 123; y <= 987; y++)
{
if (m * n == x * y)
{
if (fun(m, 1, a) && fun(n, 3, a + 1) && fun(x, 2, a + 4) && fun(y, 3, a + 6))
{
printf(“No.%d: %d * %d = %d * %d\n”, ++count, m, n, x, y);
}
}
else
{
continue;
}
}
}
}
}
count = 0;
//第五类 O * OOO = O * OOOO
printf(“\nO * OOO = O * OOOO :\n”);
for (m = 1; m <= 9; m++)
{
for (n = 123; n <= 987; n++)
{
for (x = 1; x <= 9; x++)
{
for (y = 1234; y <= 9876; y++)
{
if (m * n == x * y)
{
if (fun(m, 1, a) && fun(n, 3, a + 1) && fun(x, 1, a + 4) && fun(y, 4, a + 5))
{
printf(“No.%d: %d * %d = %d * %d\n”, ++count, m, n, x, y);
}
}
else
{
continue;
}
}
}
}
}
count = 0;
//第六类 OO * OO = O * OOOO
printf(“\nOO * OO = O * OOOO :\n”);
for (m = 12; m <= 98; m++)
{
for (n = 98; n > m; n–)
{
for (x = 1; x <= 9; x++)
{
for (y = 1234; y <= 9876; y++)
{
if ((m % 10) && m * n == x * y)
{
if (fun(m, 2, a) && fun(n, 2, a + 2) && fun(x, 1, a + 4) && fun(y, 4, a + 5))
{
printf(“No.%d: %d * %d = %d * %d\n”, ++count, m, n, x, y);
}
}
else
{
continue;
}
}
}
}
}
count = 0;
//第七类 OO * OO = OO * OOO
printf(“\nOO * OO = OO * OOO :\n”);
for (m = 12; m <= 98; m++)
{
for (n = 98; n > m; n–)
{
for (x = 12; x <= 98; x++)
{
for (y = 123; y <= 987; y++)
{
if ((m % 10) && m * n == x * y)
{
if (fun(m, 2, a) && fun(n, 2, a + 2) && fun(x, 2, a + 4) && fun(y, 3, a + 6))
{
printf(“No.%d: %d * %d = %d * %d\n”, ++count, m, n, x, y);
}
}
else
{
continue;
}
}
}
}
}
return 0;
}
//最最最重要的调用函数，判断9位数不相同
int fun(int t, int k, int *z)
{
int *p1, *p2;

for (p1 = z; p1 < z + k; p1++)
{
    *p1 = t % 10;
    t /= 10;

    for (p2 = a; p2 < p1; p2++)
    {
        if (*p1 == 0 || *p1 == *p2)
        {
            return 0;
        }
    }
}

return 1;

}