AcWing 842. 排列数字
原题链接
简单
作者:
dark_7
,
2021-12-05 23:42:35
,
所有人可见
,
阅读 173
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
#include <iostream>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <cstdio>
#include <iomanip>
#include <sstream>
#include <vector>
//#include <list>
//#include <stack>
//#include <queue>
//#include <set>
//#include <map>
#define endl "\n"
using namespace std;
typedef long long LL;
typedef unsigned long long uLL;
int n;
int a[10];
int f[10];
void dfs(int u) {
if (u > n) {
for (int i = 1;i <= n;i++)
cout << a[i] << ' ';
cout << endl;
}
for (int i = 1;i <= n;i++) {
if (f[i] == 0)
{
a[u] = i;
f[i] = 1;
dfs(u + 1);
f[i] = 0;
}
}
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
cin >> n;
dfs(1);
return 0;
}