Pagini recente » Cod sursa (job #1473148) | Cod sursa (job #2064261) | Cod sursa (job #957668) | Cod sursa (job #2962797) | Cod sursa (job #521164)
Cod sursa(job #521164)
#include <stdio.h>
#include <stdlib.h>
int n, k;
int* to_print;
int max;
int len;
void read_data()
{
scanf("%d", &n);
scanf("%d", &k);
}
void print_one()
{
int i;
if (len == k)
{
for (i = 0; i < k; ++i)
printf("%d ", to_print[i]);
printf("\n");
}
else
{
for (i = max; i <= n-k+len; ++i)
{
to_print[len] = i+1;
max = i+1;
len++;
print_one();
len--;
if (len == 0)
max = 0;
else
max = to_print[len-1];
}
}
}
void print_data()
{
to_print = malloc(k*sizeof(int));
len = 0;
max = 0;
print_one();
free(to_print);
}
int main()
{
freopen("combinari.in", "r", stdin);
freopen("combinari.out", "w", stdout);
read_data();
print_data();
return 0;
}