#include <stdio.h>
void backtrack(int n, int m, int start, int* comb, int len) {
if (len == m) {
for (int i = 0; i < m; i++)
{
printf("%d ", comb[i]);
}
printf("\n");
return;
}
for (int i = start; i <= n; i += 2) {
comb[len] = i;
backtrack(n, m, i + 2, comb, len + 1);
}
} void getComb(int n, int m) {
int comb[m];
backtrack(n, m, 1, comb, 0);
}
int main() {
int n, m;
printf("请输入正整数 n 和 m:");
scanf("%d %d", &n, &m);
printf("从 1 到 %d 的奇数中取 %d 个数的所有组合:\n", n, m);
getComb(n, m);
return 0;
}