Pagini recente » Cod sursa (job #2031372) | Cod sursa (job #206716) | Cod sursa (job #1349962) | Cod sursa (job #1487289) | Cod sursa (job #1028727)
#include <stdio.h>
using namespace std;
int N, size;
int v[10], aux[10];
inline void read(){
freopen("permutari.in","r",stdin);
freopen("permutari.out","w",stdout);
scanf("%d", &N);
}
inline void print_sol(){
for (int i = 0; i < N; i++)
printf("%d ",v[i]);
printf("\n");
}
void back(){
int count;
for (int i = 1; i <= N; i++)
if (aux[i] == 0){
aux[i] = 1;
v[size++] = i;
if (size < N)
back();
else
print_sol();
size--;
aux[i] = 0;
}
}
int main() {
read();
back();
return 0;
}