Pagini recente » Clasament cosmin_oni2018z2 | Cod sursa (job #2583712) | Cod sursa (job #2728094) | Cod sursa (job #2923045) | Cod sursa (job #3182760)
#include <bits/stdc++.h>
using namespace std;
ifstream in("permutari.in");
ofstream out("permutari.out");
vector <int> v;
bool ap[10];
void afisare(){
for( int i = 0; i < v.size(); i++ )
out << v[i] << " ";
if( v.size() )
out << "\n";
}
void bkt( int pas, int n ){
if( pas > n ){
afisare();
return;
}
for( int i = 1; i <= n; i++ ){
if( !ap[i] ){
ap[i] = 1;
v.push_back(i);
bkt(pas+1, n);
ap[i] = 0;
v.pop_back();
}
}
}
int main()
{
int n;
in >> n;
bkt(1, n);
return 0;
}