Pagini recente » Cod sursa (job #2378411) | Cod sursa (job #2514482) | Cod sursa (job #781510) | Cod sursa (job #84634) | Cod sursa (job #2306942)
#include <bits/stdc++.h>
#define N 9
#define ll long long
#define f first
#define s second
using namespace std;
ifstream in("permutari.in");
ofstream out("permutari.out");
int r[N],n,k=0;
bool v[N];
void bk(){
int i;
if(k==n){
for(i=1; i<=n; ++i)
out<<r[i]<<" ";
out<<"\n";
return;
}
for(i=1; i<=n; ++i){
if(!v[i]){
r[++k]=i;
v[i]=1;
bk();
--k;
v[i]=0;
}
}
}
int main(){
in>>n;
bk();
return 0;
}