Pagini recente » Rating Romeo Tudureanu (romeo.tudureanu) | Cod sursa (job #251981) | Cod sursa (job #3291398) | Cod sursa (job #3262776) | Cod sursa (job #283620)
Cod sursa(job #283620)
#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;
#define FIN "permutari.in"
#define FOUT "permutari.out"
int N;
vector<int> P;
void read() {
scanf("%d", &N);
}
void solve() {
for (int i = 1; i <= N; ++i)
P.push_back(i);
do {
for (int i = 0; i < N; ++i)
printf("%d ", P[i]);
printf("\n");
} while (next_permutation(P.begin(), P.end()));
}
int main() {
freopen(FIN, "r", stdin);
freopen(FOUT, "w", stdout);
read();
solve();
return 0;
}