Pagini recente » Cod sursa (job #2327210) | Cod sursa (job #1087405) | Istoria paginii runda/simulare_oji_2023_clasa_9_17_martie/clasament | Cod sursa (job #1994954) | Cod sursa (job #1993983)
#include <iostream>
#include <fstream>
#include <cstdlib>
#include <vector>
using namespace std;
ifstream in("permutari.in");
ofstream out("permutari.out");
#define ll long long
#define pb push_back
#define ui unsigned int
const int inf = 1e9 + 5;
const int NMax = 50 + 5;
int N;
int v[NMax];
bool vis[NMax];
void backT(int);
int main() {
in>>N;
backT(1);
in.close();out.close();
return 0;
}
void backT(int idx) {
if (idx == N + 1) {
for (int i=1;i <= N;++i) {
out<<v[i]<<' ';
}
out<<'\n';
return;
}
for (int k=1;k <= N;++k) {
if (vis[k]) {
continue;
}
v[idx] = k;
vis[k] = true;
backT(idx+1);
vis[k] = false;
}
}