Pagini recente » Cod sursa (job #1151186) | Cod sursa (job #2587377) | Cod sursa (job #1760101) | Cod sursa (job #2498176) | Cod sursa (job #791268)
Cod sursa(job #791268)
#include <stdio.h>
int N;
int K;
int v[18];
void print(FILE *g)
{
int i;
for (i = 0; i < K; i++)
fprintf(g, "%d ", v[i]);
fprintf(g, "\n");
}
void comb(int k, FILE *g)
{
int i;
//printf("comb k = %d\n", k);
if (k == K) {
print(g);
return;
}
for (i = 1; i <= N; i++) {
//printf("k = %d, i = %d\n", k, i);
if (k == 0)
v[k] = i;
else {
if (i > v[k-1])
v[k] = i;
else
continue;
}
comb(k+1, g);
}
}
int main(void)
{
FILE *f = fopen("combinari.in", "r");
if (!f)
return -1;
FILE *g = fopen("combinari.out", "w");
fscanf(f, "%d %d", &N, &K);
//printf("N %d, K = %d\n", N, K);
comb(0, g);
return 0;
}