Pagini recente » Istoria paginii runda/asda2dasd | Diferente pentru utilizator/eudanip intre reviziile 81 si 100 | Statistici Damian Alin (alynutzu77) | Istoria paginii utilizator/hjkls21 | Cod sursa (job #2013706)
#include <iostream>
#include <fstream>
#include <deque>
#define ll long long
#define ull unsigned long long
#define pb push_back
using namespace std;
ifstream in("permutari.in");
ofstream out("permutari.out");
const int NMax = 1e2 + 5;
const ll inf = 1e18 + 5;
int N;
bool vis[NMax];
int v[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;
}
vis[k] = true;
v[idx] = k;
backT(idx+1);
vis[k] = false;
}
}