#include <bits/stdc++.h> using namespace std; int main( ) { long long x,y,z,cnt=0; int a[10]; // 创建需要进行全排列的原始序列 for(int i = 1; i <= 9; i ++) a[i] = i; do{ x = a[1] * 100 + a[2] * 10 + a[3]; y = a[4] * 100 + a[5] * 10 + a[6]; z = a[7] * 100 + a[8] * 10 + a[9]; if(x * 2 == y * 1 && y * 3 == z * 2) { cout<<x<<" "<<y<<" "<<z<<" "<<endl; cnt ++; } }while(next_permutation(a+1,a+10)); if(!cnt) cout<<"No!!!"; return 0; }