Pagini recente » Cod sursa (job #1906565) | Cod sursa (job #2119679) | Cod sursa (job #363919) | Cod sursa (job #1625457) | Cod sursa (job #154922)
Cod sursa(job #154922)
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
int N,
p[8];
int main(int argc, char *argv[]) {
ifstream fin("permutari.in");
fin >> N;
fin.close();
for (int i(0); i < N; ++i)
p[i] = i + 1;
FILE *fo = fopen("permutari.out", "w");
do {
for (int i(0); i < N; ++i)
fprintf(fo, "%d ", p[i]);
fprintf(fo, "\n");
} while (next_permutation(p, p + N));
fclose(fo);
return 0;
}