Pagini recente » Cod sursa (job #1815925) | Istoria paginii runda/franceza | Cod sursa (job #2110556) | Cod sursa (job #358668) | Cod sursa (job #305302)
Cod sursa(job #305302)
#include <cstdio>
#include <algorithm>
const int NMAX = 9;
int main()
{
int N, i, x[NMAX] = {};
freopen("permutari.in", "r", stdin);
freopen("permutari.out", "w", stdout);
scanf("%d/n", &N);
for (i = 0; i != N; ++i) x[i] = i + 1;
do {
;
for (i = 0; i != N; ++i) printf("%d ", x[i]);
printf("\n");
} while(std::next_permutation(x, x + N));
return 0;
}