Pagini recente » Borderou de evaluare (job #732015) | Cod sursa (job #2173235) | Cod sursa (job #1200626) | Cod sursa (job #1965902) | Cod sursa (job #1975492)
#include <iostream>
#include <fstream>
#include <vector>
#include <cstring>
using namespace std;
ifstream in("permutari.in");
ofstream out("permutari.out");
#define pb push_back
const int NMax = 10;
int N;
int v[NMax];
bool viz[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 (viz[k]) {
continue;
}
v[idx] = k;
viz[k] = true;
backT(idx+1);
viz[k] = false;
}
}