next_permutation全排列公式
数据不大,直接暴力全排列模拟出数据即可
using namespace std;
int p[9]={1,2,3,4,5,6,7,8,9};
int main(){
int a,b,c;
cin>>a>>b>>c;
int cnt=0;
do{
int x=p[0]*100+p[1]*10+p[2];
int y=p[3]*100+p[4]*10+p[5];
int z=p[6]*100+p[7]*10+p[8];
if(a*z==c*x&&b*z==c*y){
cnt++;
cout<<x<<" "<<y<<" "<<z<<"\n";
}
}while(next_permutation(p,p+9));
if(!cnt){
cout<<"No!!!";
}
return 0;
}
标签:10,cnt,连击,int,P1031,100
From: https://www.cnblogs.com/yufan1102/p/17866038.html