Pagini recente » Cod sursa (job #2113129) | Cod sursa (job #2016535) | Cod sursa (job #3329367) | Cod sursa (job #3313630) | Cod sursa (job #3354615)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("permutari.in");
ofstream fout("permutari.out");
int visited[10];
vector<vector<int>>sol;
void back(int n, vector<int>ans)
{
if (ans.size() == n) {
sol.push_back(ans);
return;
}
for (int i = 1; i <= n; i++) {
if (visited[i] == 0) {
visited[i] = 1;
ans.push_back(i);
back(n, ans);
ans.pop_back();
visited[i] = 0;
}
}
}
int main() {
int n;
fin>>n;
vector<int>ans;
back(n, ans);
for (int i = 0; i < sol.size(); i++) {
for (int j = 0; j < sol[i].size(); j++) {
fout<<sol[i][j]<<" ";
}
fout<<endl;
}
}