Pagini recente » Cod sursa (job #424385) | Cod sursa (job #735837) | Cod sursa (job #3001791) | Cod sursa (job #665072) | Cod sursa (job #2219538)
/**
* Worg
*/
#include <cstdio>
FILE *fin = freopen("combinari.in", "r", stdin); FILE *fout = freopen("combinari.out", "w", stdout);
const int MAX_N = 18 + 1;
int used[MAX_N];
int v[MAX_N];
void Back(const int &n, const int &k, int value, int chosen) {
if(chosen == k) {
for(int i = 1; i <= k; i++) {
printf("%d ", v[i]);
}
printf("\n");
return;
} else if(value == n + 1) {
return;
} else {
v[chosen + 1] = value; Back(n, k, value + 1, chosen + 1);
Back(n, k, value + 1, chosen);
}
}
int main() {
int n, k; scanf("%d%d", &n, &k);
Back(n, k, 1, 0);
return 0;
}