Pagini recente » Cod sursa (job #332366) | Cod sursa (job #1640035) | Cod sursa (job #2496306) | Istoria paginii runda/bibelcontest | Cod sursa (job #1561156)
#include<cstdio>
using namespace std;
int N;
int v[10];
void bk (int);
int main()
{
freopen("permutari.in","r",stdin);
freopen("permutari.out","w",stdout);
scanf("%d", &N);
bk(0);
}
void bk (int k)
{
if (k == N)
{
for (int i = 1; i <= N; i++)
printf("%d ", v[i]);
printf("\n");
}
else
for (int i = 1; i <= N; i++)
{
bool ok = 1;
for (int j = 1; j <= k; j++)
if (v[j] == i)
{
ok = 0;
break;
}
if (ok)
{
v[k + 1] = i;
bk(k + 1);
}
}
}