Pagini recente » Cod sursa (job #771637) | Cod sursa (job #3201693) | Cod sursa (job #904741) | Istoria paginii runda/eusebiu_oji_2008si2009_cls11-12 | Cod sursa (job #2241266)
#include <cstdio>
using namespace std;
int n, k, viz[40], c[40];
void comb(int m)
{
if (m == k + 1) {
for (int i = 1; i <= k; ++i) printf("%d ", c[i]);
printf("\n");
}
else for (int i = c[m - 1] + 1; i <= n - k + m; ++i) {
c[m] = i;
comb(m + 1);
}
}
int main()
{
FILE *in, *out;
in = freopen("combinari.in", "r", stdin);
out = freopen("combinari.out", "w", stdout);
scanf("%d%d", &n, &k);
fclose(in);
comb(1);
fclose(out);
return 0;
}