Pagini recente » Cod sursa (job #3129992) | Cod sursa (job #1037842) | Cod sursa (job #2655820) | Cod sursa (job #2941938) | Cod sursa (job #1495752)
#include <cstdio>
using namespace std;
int n, m, v[20];
void bkt(int k) {
if(k == m + 1) {
for(int i = 1; i <= m; ++ i)
printf("%d ", v[i]);
printf("\n");
} else {
for(int i = v[k - 1] + 1; i <= n; ++ i) {
v[k] = i;
bkt(k + 1);
v[k] = 0;
}
}
}
int main() {
freopen("combinari.in", "r", stdin);
freopen("combinari.out", "w", stdout);
scanf("%d%d", &n, &m);
bkt(1);
return 0;
}