Pagini recente » Borderou de evaluare (job #2040897) | Cod sursa (job #1670284) | Cod sursa (job #875017) | Istoria paginii runda/dist2 | Cod sursa (job #2606765)
#include <fstream>
using namespace std;
ifstream fin ("permutari.in");
ofstream fout("permutari.out");
int isUsed[10];
int st[10];
int n;
void backtracking(int k) {
if (k == n + 1) {
for (int i = 1;i <= n;i ++)
fout << st[i] << ' ';
fout << '\n';
return;
}
for (int i = 1;i <= n;i ++)
if (!isUsed[i]) {
st[k] = i;
isUsed[i] = 1;
backtracking(k + 1);
isUsed[i] = 0;
}
}
int main() {
fin >> n;
backtracking(1);
return 0;
}