You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
|
|
|
|
|
//<2F><><EFBFBD><EFBFBD>һ<EFBFBD><D2BB><EFBFBD><EFBFBD>n(1<=n<=9)<29><><EFBFBD><EFBFBD><EFBFBD><EFBFBD>1~n<><6E>ȫ<EFBFBD><C8AB><EFBFBD><EFBFBD>
|
|
|
|
|
|
#include<bits/stdc++.h>
|
|
|
|
|
|
|
|
|
|
|
|
int book[10];//<2F><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>е<EFBFBD><D0B5><EFBFBD><EFBFBD><EFBFBD>
|
|
|
|
|
|
int array[10];//<2F><><EFBFBD><EFBFBD>
|
|
|
|
|
|
|
|
|
|
|
|
//<2F><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ٸ<EFBFBD><D9B8><EFBFBD><EFBFBD><EFBFBD>ȫ<EFBFBD><C8AB><EFBFBD><EFBFBD>
|
|
|
|
|
|
int n;
|
|
|
|
|
|
|
|
|
|
|
|
//dfs<66><73><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
|
|
|
|
|
|
void dfs(int step)
|
|
|
|
|
|
{
|
|
|
|
|
|
if(step==n+1){
|
|
|
|
|
|
for(int i=1;i<=n;i++)
|
|
|
|
|
|
printf("%d%c",array[i],i==n?'\n':' ');
|
|
|
|
|
|
return;
|
|
|
|
|
|
}
|
|
|
|
|
|
for(int i=1;i<=n;i++){
|
|
|
|
|
|
if(book[i]==0){
|
|
|
|
|
|
array[step]=i;
|
|
|
|
|
|
book[i]=1;
|
|
|
|
|
|
dfs(step+1);
|
|
|
|
|
|
book[i]=0;
|
|
|
|
|
|
}
|
|
|
|
|
|
}
|
|
|
|
|
|
return;
|
|
|
|
|
|
}
|
|
|
|
|
|
int main()
|
|
|
|
|
|
{
|
|
|
|
|
|
//<2F><>ʼ<EFBFBD><CABC>book<6F><6B><EFBFBD><EFBFBD>
|
|
|
|
|
|
memset(book,0,sizeof(book));
|
|
|
|
|
|
//<2F><><EFBFBD>ո<EFBFBD><D5B8><EFBFBD>
|
|
|
|
|
|
scanf("%d",&n);
|
|
|
|
|
|
dfs(1);
|
|
|
|
|
|
return 0;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
