Pagini recente » Cod sursa (job #1665232) | Cod sursa (job #2307984) | Cod sursa (job #845871) | Istoria paginii runda/baraj1 | Cod sursa (job #1977560)
#include <iostream>
#include <fstream>
#include <vector>
#include <cstring>
using namespace std;
ifstream in("permutari.in");
ofstream out("permutari.out");
#define pb push_back
#define ll long long
const int NMax = 1e7 + 5;
int N;
bool vis[20];
int v[20];
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;
}
}