<NOIP> 27 . P1618 三连击（升级版）

题解：这道题是洛谷的第27道题目，我是感觉不需要递归全排列，依旧是暴力即可。

源代码：

#include <iostream>
#include <stdlib.h>
#include <math.h>

using namespace std;

#include <iostream>
#include <stdlib.h>

using namespace std;

bool check(int *first, int *second)
{
    if (first[0] != second[0] && first[0] != second[1] && first[0] != second[2] &&
        first[1] != second[0] && first[1] != second[1] && first[1] != second[2] &&
        first[2] != second[0] && first[2] != second[1] && first[2] != second[2] &&
        first[0] != first[1] && first[0] != first[2] && first[1] != first[2] &&
        second[0] != second[1] && second[0] != second[2] && second[1] != second[2] &&
        first[1] != 0 && first[2] != 0 && second[1] != 0 && second[2] != 0)
        return true;
    else
        return false;
}

int main()
{
    bool is = false;
    int a1, a2, a3;
    cin >> a1 >> a2 >> a3;
    for (size_t i = 100; i < 1000; i++)
    {
        int a = i;
        int b = (a2*a / a1);
        int c = (a3*a / a1);

        int d = a;
        int e = b;
        int f = c;

        if (b < 1000 && c < 1000)
        {
            // 提取位数；
            int aArray[3],
                bArray[3],
                cArray[3];

            for (size_t i = 0; i < 3; i++)
            {
                aArray[i] = a % 10; a /= 10;
                bArray[i] = b % 10; b /= 10;
                cArray[i] = c % 10; c /= 10;
            }

            if (check(aArray, bArray) && check(aArray, cArray) && check(bArray, cArray))
            {
                cout << d << " " << e << " " << f << endl;
                is = true;
            }
        }
    }

    if (!is) cout << "No!!!" << endl;
    system("pause");
    return 0;
}