标签：优先级 int sum dfs xb 搜索 深度 return include
一、输出1~n的全排列
#include<bits/stdc++.h>
using namespace std;
int n,a[1005];
bool vis[1005];
void dfs(int x){
if(x==n+1){
for(int i=1;i<=n;i++){
cout<<a[i]<<" ";
}
cout<<endl;
return ;
}
for(int i=1;i<=n;i++){
if(!vis[i]){
a[x]=i;
vis[i]=true;
dfs(x+1);
vis[i]=false;
}
}
}
int main(){
// freopen("name.in","r",stdin);
// freopen("name.out","w",stdout);
cin>>n;
dfs(1);
return 0;
}
二、能否用n根小木棍拼出m边形
#include<bits/stdc++.h>
#include<algorithm>
using namespace std;
int n,m,a[105],sum;
bool f;
void dfs(int x,int ans,int xb){
if(ans==sum/m)dfs(x+1,0,xb);
if(f)return ;
if(x==n){
f=true;
return ;
}
for(int i=xb+1;i<=n;i++){
if(ans+a[i]<=sum/m)dfs(x,ans+a[i],i);
}
}
int main(){
ios::sync_with_stdio(false);
cin>>n>>m;
for(int i=1;i<=n;i++){
cin>>a[i];
sum+=a[i];
}
if(sum%m!=0||n<4){
cout<<"no";
return 0;
}
dfs(1,0,0);
if(f)cout<<"yes";
else cout<<"no";
return 0;
}
标签：优先级,
int,
sum,
dfs,
xb,
搜索,
深度,
return,
include
From： https://www.cnblogs.com/hnzzlxs01/p/16655934.html