Pagini recente » Cod sursa (job #2532461) | Cod sursa (job #360547) | Cod sursa (job #1597143) | Cod sursa (job #2945369) | Cod sursa (job #1976041)
#include <cstdio>
using namespace std;
int n, v[10];
bool f[10];
void afisare()
{
for(int i = 1; i <= n; ++i) printf("%d ", v[i]);
printf("\n");
}
void bkt(int k)
{
for(int i = 1; i <= n; ++i)
if(!f[i])
{
v[k] = i;
f[i] = 1;
if(k == n) afisare();
else bkt(k+1);
f[i] = 0;
}
}
int main()
{
freopen("permutari.in", "r", stdin);
freopen("permutari.out", "w", stdout);
scanf("%d", &n);
fclose(stdin);
bkt(1);
fclose(stdout);
return 0;
}