next_permutation解决全排列问题
by lqx
本质是dfs
next_permutation模板
#include <bits/stdc++.h>
using namespace std;
signed main(){
int a[]={3,2,1};
sort(a,a+3);//升序排序
do{
for(int i=0;i<3;i++)
cout<<a[i]<<" ";
cout<<'\n';
}while(next_permutation(a,a+3));
}
破解数字谜语
#include <bits/stdc++.h>
#define int long long
using namespace std;
//send + more = money
//m=1 s=?,e=?,n=?,d=?,o=?,r=?,y=?
signed main(){
int a[9]={0,2,3,4,5,6,7,8,9};
int i,j,k=0;
do{
i=a[0]*1000+a[1]*100+a[2]*10+a[3];
j=1000+a[4]*100+a[5]*10+a[1];
k=10000+a[4]*1000+a[2]*100+a[1]*10+a[6];
if(i+j==k)break;
}while(next_permutation(a,a+9));
cout<<i<<"+"<<j<<"="<<k<<'\n';
printf("m=1\ns=%d\ne=%d\nn=%d\nd=%d\no=%d\nr=%d\ny=%d\n",a[0],a[1],a[2],a[3],a[4],a[5],a[6]);
}
带分数(蓝桥13省赛)
#include<bits/stdc++.h>
using namespace std;
#define int long long
int sum=0;
int a[]={1,2,3,4,5,6,7,8,9};
int get(int l,int r){
int num=0;
for(int i=l;i<r;i++)
num=num*10+a[i];
return num;
}
signed main(){
int n;cin>>n;
do{
for(int i=1;i<9;i++)
for(int j=i+1;j<9;j++){
int num1=get(0,i);
int num2=get(i,j);
int num3=get(j,9);
if(n*num3==num2+num1*num3) sum++;
}
}while(next_permutation(a,a+9));
cout<<sum;
}
凑算式(蓝桥16省赛)
#include <bits/stdc++.h>
using namespace std;
#define int long long
int v[]={1,2,3,4,5,6,7,8,9};//A*C*GHI+B*GHI+DEF*C=10*C*GHI
signed main(){
int a,b,c,d,g;//a*c*g+b*g+d*c==10*c*g
int cnt=0;
do{
a=v[0];
b=v[1];
c=v[2];
d=v[3]*100+v[4]*10+v[5];
g=v[6]*100+v[7]*10+v[8];
if(a*c*g+b*g+d*c==10*c*g)cnt++;
}while(next_permutation(v,v+9));
cout<<cnt;
}