题解 | #排列式#

#include #include<bits/stdc++.h> using namespace std; void judge(int result,int l,int r) { if(result==lr) { cout<<result<<" = "<<l<<" x "<<r<<endl; } } void next(int a[]) { int result; int l1,r1; int l2,r2; do { //一位数四位数的情况 result=a[0]*1000+a[1]*100+a[2]*10+a[3]; l1=a[4]; r1=a[5]*1000+a[6]*100+a[7]10+a[8]; judge(result,l1,r1); //两位数三位数的情况 l2=a[4]*10+a[5]; r2=a[6]*100+a[7]*10+a[8]; judge(result,l2,r2);

}while(next_permutation(a,a+9));

} int main() { int a[9]={1,2,3,4,5,6,7,8,9}; next(a); return 0; } //新手学习day1，代码学习于网络，仅分享 //https://blog.csdn.net/tom_jjJack/article/details/125381503