Pagini recente » Cod sursa (job #2906330) | Cod sursa (job #2678771) | Cod sursa (job #2169611) | Cod sursa (job #533171) | Cod sursa (job #2347429)
#include <bits/stdc++.h>
#define nmax 100005
using namespace std;
typedef pair<int, int> pii;
vector<int>v(100);
bool marked[100];
int N, M;
inline void Solve(int cur, int N) {
if (cur > N) {
for (int i = 1; i <= N; ++i) {
cout << v[i]<<" ";
}
cout << "\n";
return;
}
for (int i = 1; i <= N; ++i) {
if (!marked[i]) {
v[cur] = i;
marked[i] = 1;
Solve(cur + 1, N);
marked[i] = 0;
}
}
}
int main(){
int i;
freopen("permutari.in","r",stdin);
freopen("permutari.out","w",stdout);
// ios::sync_with_stdio(false);
cin >> N;
Solve(1, N);
return 0;
}