Cod sursa(job #2990852)
| Utilizator | Data | 8 martie 2023 17:46:54 | |
|---|---|---|---|
| Problema | Generare de permutari | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.47 kb |
#include<bits/stdc++.h>
using namespace std;
const int N = 10;
bool used[N];
int n, perm[N];
//ifstream in ("permutari.in");
//ofstream out("permutari.out");
auto& in = cin;
auto& out = cout;
void show() {
for(int i=0;i<n;i++)
out<<perm[i]<<' ';
out<<endl;
}
void permut(int p) {
if(p == n) {show(); return;}
for(int i=1; i<=n; i++)
if(!used[i]) {
used[i] = true;
perm[p] = i;
permut(p+1);
used[i] = false;
}
}
int main(){
in>>n;
permut(0);
return 0;
}