#include<stdio.h> int a[21] = { 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0 }; int result[21]; int n, r; int j = 0; void dfs(int x) {//x表示當前是第幾個數int ii;if (x > r) {for (ii = 0; ii < r; ii++) {printf("%3d", result[ii]);}printf("\n");return;}for (ii = x; ii <=n-r+x; ii++) {if (a[ii] == 0&&(x==1||ii>result[x-2])) {//每個數都必須比他的前一個數大a[ii] = 1;result[x-1] = ii;dfs(x + 1);a[ii] = 0;}} }int main() {scanf("%d %d", &n, &r);dfs(1);return 0; }

?

轉載于:https://www.cnblogs.com/lin0/p/8599463.html

總結

以上是生活随笔為你收集整理的洛谷P1157----组合数的输出的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。