图片说明
此题学习到STL的next_permutation的全排列功能！！！
#include<iostream>
#include<iomanip>
#include<math.h>
#include<string>
#include<string.h>
#include<stack>
#include<vector>
#include<cstring>
#include<algorithm>
#define pi acos(-1)
using namespace std;
int main()
{
int a[10] = { 0,1,2,3,4,5,6,7,8,9 };
int A, B, C,hhh=0;
cin >> A >> B >> C;
do
{
if ((a[1] * 100 + a[2] * 10 + a[3])BC == (a[4] * 100 + a[5] * 10 + a[6])AC && (a[1] * 100 + a[2] * 10 + a[3])BC == (a[7] * 100 + a[8] * 10 + a[9])AB)
{
hhh++;
cout << a[1] << a[2] << a[3] << " " << a[4] << a[5] << a[6] << " " << a[7] << a[8] << a[9] << endl;
}
} while (next_permutation(a + 1, a + 10));
if (hhh == 0)
cout << "No!!!" << endl;</algorithm></cstring></vector></stack></string></iomanip></iostream>

return 0;

}