Pagini recente » Diferente pentru olimpici intre reviziile 62 si 180 | Atasamentele paginii oni_9_00 | Cod sursa (job #2482992) | Istoria paginii runda/test__123/clasament | Cod sursa (job #1220144)
#include <iostream>
#include <cstdio>
#include <vector>
#include <stack>
#include <algorithm>
#include <fstream>
using namespace std;
#define inf 0xfffffff
int x[10], n;
int main() {
int a, b, c;
freopen("permutari.in","r",stdin);
freopen("permutari.out","w",stdout);
scanf("%d", &n);
for (int i = 1; i <= n; i++) x[i] = i;
do {
for (int i = 1; i <= n; i++) printf("%d ", x[i]);
printf("\n");
} while (next_permutation(x+1,x+n+1));
return 0;
}