Cod sursa(job #1913264)
Utilizator | Data | 8 martie 2017 12:22:11 | |
---|---|---|---|
Problema | Generare de permutari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.6 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("permutari.in");
ofstream g("permutari.out");
const int NMax = 21;
int n,k;
int st[NMax],fol[NMax];
void back(int k){
for(int i = 1; i <= n; ++i){
if(!fol[i]){
fol[i] = 1;
st[k] = i;
if(k == n){
for(int j = 1; j <= n; ++j){
g << st[j] << ' ';
}
g << '\n';
}else
back(k + 1);
fol[i] = 0;
}
}
}
int main()
{
f >> n;
back(1);
return 0;
}