Pagini recente » Cod sursa (job #2852696) | Cod sursa (job #2704507) | Cod sursa (job #2688398) | Cod sursa (job #2771588) | Cod sursa (job #227999)
Cod sursa(job #227999)
#include <cstdio>
#include <algorithm>
using namespace std;
int n, k;
int main() {
freopen("combinari.in", "r", stdin);
freopen("combinari.out", "w", stdout);
scanf("%d %d", &n, &k);
int i, j;
// n = 4; k = 3;
for (i = 0; i < (1 << n); ++i) if (__builtin_popcount(i) == k) {
for (j = 0; j < n; ++j) if (i & (1 << j)) printf("%d ", j +1);
printf("\n");
}
return 0;
}