已知组合数的递归定义如下所示,编写递归程序求Ckn
(1)先写递归函数
(2)再写主函数
#includeint main(){ int seek(int k, int n); int k, n; int result; do{ printf("输入k,n(0<=k<=n):n"); scanf("%d,%d", &k, &n); }while(k < 0 || k > n || n < 0); result = seek(k, n); printf("%d", result); } int seek(int k, int n){ if(k == n || k == 0) return 1; return seek(k-1,n-1) + seek(k, n-1); }



