Cod sursa(job #263369)
Utilizator | Matei-Dan Epure motty | Data | 20 februarie 2009 12:11:37 |
---|---|---|---|
Problema | Generare de permutari | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include<stdio.h>
#define N 9
int n,sol[N];
void afisare()
{
for(int i=1;i<=n;++i)
printf("%d ",sol[i]);
printf("\n");
}
char valid(int k)
{
for(int i=1;i<k;++i)
if(sol[i]==sol[k])
return 0;
return 1;
}
void back(int k)
{
if(k==n+1)
{
afisare();
return;
}
for(int i=1;i<=n;++i)
{
sol[k]=i;
if(valid(k))
back(k+1);
}
}
int main()
{
freopen("permutari.in","r",stdin);
freopen("permutari.out","w",stdout);
scanf("%d",&n);
return 0;
}