Pagini recente » Sandbox (cutiuţa cu năsip) | Cod sursa (job #705669) | Cod sursa (job #2197292) | Cod sursa (job #438507) | Cod sursa (job #759821)
Cod sursa(job #759821)
#include <cstdio>
#include <conio.h>
using namespace std;
int n, st[8];
void permutari(int);
int main()
{
//freopen("permutari.in", "r", stdin);
//freopen("permutari.out", "w", stdout);
scanf("%d", &n);
permutari(0);
getch();
return 0;
}
void permutari(int schritt)
{
for (int i = 1; i <= n; i++)
{
bool ok = true;
for (int j = 0; j < schritt; j++)
if (st[j] == i)
{ ok = false; break; }
if (ok == false)
continue;
st[schritt] = i;
if (schritt + 1 == n)
{
for(int j = 0; j < n; j++)
printf("%d ", st[j]);
printf("\n");
}
else
permutari(schritt + 1);
}
}