Pagini recente » Cod sursa (job #25501) | Cod sursa (job #1148452) | Cod sursa (job #1164194) | Cod sursa (job #627665) | Cod sursa (job #293272)
Cod sursa(job #293272)
#include<stdio.h>
long i, n, m, a[21], uz[21];
FILE *fin, *fout;
void bkt(long x)
{
if(x > m)
{
for(i = 1; i <= m; i++)
fprintf(fout, "%ld ", uz[a[i]]);
fprintf(fout, "\n");
return;
}
else
{
for(int i = a[x - 1] + 1; i <= n; i++)
{
a[x] = i;
bkt(x + 1);
}
}
}
int main()
{
fin = fopen("combinari.in", "rt");
fout = fopen("combinari.out", "wt");
fscanf(fin, "%ld %ld", &n, &m);
for(i = 1; i <= n; i++)
uz[i] = i;
bkt(1);
return 0;
}