Pagini recente » Cod sursa (job #3002245) | Cod sursa (job #548171) | Cod sursa (job #1902522) | Cod sursa (job #1613500) | Cod sursa (job #3187395)
#include <bits/stdc++.h>
using namespace std;
int n, V[10], A[10];
void back(int k){
// cout << "intru pas " << k << '\n';
if(k == n+1){
for(int i = 1; i<= n; i++){
cout << A[i] << ' ';
}
cout << '\n';
// cout << "ies pas " << k << '\n';
return;
}
for(int i=1; i<=n;i++){
if(!V[i]){
A[k] = i;
V[i] = 1;
// cout << "pas " << k << " iau " << i << '\n';
back(k+1);
// cout << "pas " << k << " scot " << i << '\n';
V[i] = 0;
}
}
// cout << "ies pas " << k << '\n';
}
int main(){
ifstream cin("permutari.in");
ofstream cout("permutari.out");
cin >> n;
back(1);
}