Cod sursa(job #293252)
Utilizator | Data | 1 aprilie 2009 09:38:02 | |
---|---|---|---|
Problema | Combinari | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include<stdio.h>
long i, n, m, a[11], uz[11];
FILE *fin, *fout;
void bkt(long x)
{
if(x == m + 1)
{
for(i = 1; i <= m; i++)
fprintf(fout, "%ld ", a[i]);
fprintf(fout, "\n");
}
else
{
for(int i = 1; i <= n; i++)
if(uz[i] == 0)
{
uz[i] = 1;
a[x] = i;
bkt(x + 1);
uz[i] = 0;
}
}
}
int main()
{
fin = fopen("permutari.in", "rt");
fout = fopen("permutari.out", "wt");
fscanf(fin, "%ld %ld", &n, &m);
bkt(1);
return 0;
}