Cod sursa(job #449246)
| Utilizator | Data | 5 mai 2010 23:04:34 | |
|---|---|---|---|
| Problema | Generare de permutari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.92 kb |
#include<iostream.h>
int n,a[11];
void perm(int q)
{ int k = 0;
if (q == n)
{
for ( int i = 1; i <= n; i ++)
printf("%d ", a [ i ]);
printf("\n");
}
for ( int i = 1; i <= n; i ++)
{ k = 0;
for (int j = 1 ; j <= q ; j ++)
if ( a[j] == i)
k = 1;
if( k == 0)
{ a[q+1] = i;
perm(q+1);
}
}
}
int main()
{
freopen("permutari.in", "r", stdin);
freopen("permutari.out", "w", stdout);
scanf("%d ", &n);
perm(0);
return 0;
}
