Pagini recente » Cod sursa (job #1463318) | Cod sursa (job #2689066) | Rating gigi duru (gigiDurul) | Istoria paginii runda/simulare1/clasament | Cod sursa (job #1296991)
#include <stdio.h>
void afisare(int n, int p[])
{
for(int i=1;i <=n; i++)
printf("%d ", p[i]);
printf("\n");
}
void back(int i, int n, int p[]) {
if (i == n+1) {
afisare(n, p);
return;
}
for (int a = 1; a <= n; a++) {
bool valid = true;
for (int j = 1; j <= i - 1; j++)
if (p[j] == a)
valid = false;
if (valid == true) {
p[i] = a;
back(i + 1, n, p);
}
}
}
int main()
{
freopen("permutari.in", "r", stdin);
freopen("permutari.out", "w", stdout);
int n, p[10];
scanf("%d", &n);
back(1, n, p);
return 0;
}