Pagini recente » Cod sursa (job #3139391) | Cod sursa (job #2504113) | Cod sursa (job #2505727) | Cod sursa (job #1100993) | Cod sursa (job #2916998)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin ("permutari.in");
ofstream fout ("permutari.out");
const int maxN = 10;
int x[maxN], fr[maxN];
int n;
void afisare () {
for(int i = 1; i <= n; ++i)
fout << x[i] << " ";
fout << '\n';
}
void bkt (int k) {
for(int i = 1; i <= n; ++i) {
x[k] = i; fr[i]++;
if(fr[i] == 1) {
if(k == n)
afisare();
else
bkt(k+1);
}
fr[i]--;
}
}
int main()
{
fin >> n;
bkt(1);
return 0;
}