Pagini recente » Cod sursa (job #1146211) | Cod sursa (job #2279660) | Cod sursa (job #1174517) | Cod sursa (job #2187047) | Cod sursa (job #2316367)
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream in("permutari.in");
ofstream out("permutari.out");
void print(vector<int> v) {
for(int i = 0; i < v.size(); ++i){
cout << v[i] << " ";
}
cout << "\n";
}
bool check(vector<int> v, int j) {
for(int i = 0; i < j; ++i) {
if(v[i] == v[j]) return false;
}
return true;
}
void perm(int n, int p = 0) {
static vector<int> v(n, 0);
for(int i = 0; i < n; ++i){
v[p] = i + 1;
if(check(v, p)){
if(p == n - 1){
print(v);
}else{
perm(n, p + 1);
}
}
}
}
int main()
{
int n;
in >> n;
perm(n);
return 0;
}