Pagini recente » Borderou de evaluare (job #1036457) | Cod sursa (job #2586924) | Cod sursa (job #1388169) | Cod sursa (job #1545376) | Cod sursa (job #1838327)
#include <cstdio>
#include <algorithm>
FILE *fin, *fout;
int v[8];
using namespace std;
int main() {
fin = fopen("permutari.in", "r");
fout = fopen("permutari.out", "w");
int n;
fscanf(fin, "%d", &n);
for(int i = 0;i < n;i++)
v[i] = i + 1;
do {
for(int i = 0;i < n;i++)
fprintf(fout, "%d ", v[i]);
fprintf(fout, "\n");
}while(next_permutation(v, v + n));
fclose(fin);
fclose(fout);
return 0;
}