这是我对上面算法写的程序. /*************从n个数中选m个,打印所组合情况*************/ int f(m,n) /*求组合情况个数,递归算法*/ { if(m==0||m==n)return 1; else if(m==1)return n; else return f(m-1,n-1)+f(m,n-1); } /********************************************************/ main() { int i,j,k,t,h,u; int m,n,temp; int count=0; int a[100]; printf("please input m,n(m<=n):") ; scanf("%d,%d",&m,&n); for(i=0;i<n;i++) a[i]=0; for(i=0;i<m;i++) a[i]=1; /*1表示选中,否则未选中*/ temp=f(m,n); /*用temp记录应该循环的次数*/ for(k=0;k<temp;k++) { for(t=0;t<n;t++) printf("%3d",a[t]); printf(" No.%2d",++count); printf("\n"); i=0;j=1; while(!(a[i]==1&&a[j]==0)) {i++ ;j++;} a[i]=0;a[j]=1; for(h=0;h<i;h++)/*将i(当前交换的值下标)左边的所有1移到最左边*/ { if(a[h]==1) { a[h]=0;a[u++]=1; } } u=0;h=0; /*重新置0,u,h仅作一次计数使用*/ } getch(); } #include <stdio.h> __int64 comb(int n,int k){ __int64 total = 0; int *c = new int[n], num0 = 0, num1 = 0, i, j, p = 1; for(i = 0; i < k; i++) c[i] = 1; for(;i < n; i++) c[i] = 0; while(p){ num0 = 0; num1 = 0; p = 0; for(i = 0; i < n-1; i++){ if(c[i] == 0) num0++; else num1++; if(c[i] == 1 && c[i+1] == 0){ num1--; c[i] = 0; c[i+1] = 1; for(j = 0; j <num1; j++) c[j] = 1; for(; j < i; j++) c[j] = 0; p = 1; total++; break; } } } return total+1; } int main(){ int n, k; while(!(n == 0 && k == 0)){ scanf("%d%d", &n, &k); printf("%I64d\n",comb(n,k)); } return 0; } 我按上面算法写的程序，怎么效率不高呢？请大侠指教，不胜感激！