Pagini recente » Cod sursa (job #2669106) | Cod sursa (job #166889) | Cod sursa (job #2989869) | Cod sursa (job #1768696) | Cod sursa (job #1753576)
#include<iostream>
using namespace std;
int *a,n;
void show(){
for(int i=0;i<n;i++){
printf("%d ",a[i]);
}
printf("\n");
}
void swap(int i,int j){
int t=a[i];
a[i]=a[j];
a[j]=t;
}
void solve(int st,int dr){
if(st==dr)show();
for(int i=st;i<=dr;i++){
swap(st,i);
solve(st+1,dr);
swap(st,i);
}
}
int main(){
freopen("permutari.in", "r", stdin);
freopen("permutari.out", "w", stdout);
scanf("%d",&n);
a=(int*)malloc(sizeof(int*)*100000);
for(int i=0;i<n;i++){
a[i]=i+1;
}
solve(0,n-1);
}