Cod sursa(job #1742959)
Utilizator | Data | 17 august 2016 13:05:59 | |
---|---|---|---|
Problema | Generare de permutari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.55 kb |
#include<stdio.h>
int visit[10],sir[10];
void solve(int k, int n)
{
if (k == n)
{
for(int i = 1; i <= n; i++)
printf("%d ",sir[i]);
printf("\n");
}
for(int i = 1; i <= n; i++)
{
if( !visit[i])
{
visit[i] = 1;
sir[k + 1] = i;
solve(k + 1, n);
visit[i] = 0;
}
}
}
int main(void)
{
int n;
freopen("permutari.in","r",stdin);
freopen("permutari.out","w",stdout);
scanf("%d", &n);
solve(0,n);
}