求解算法：输出从n个自然数中取出k个（k<=n）的所有组合。

[lansedamo]

求解算法：输出从n个自然数中取出k个（k<=n）的所有组合。例如当n=5，k=3时，算法输出：543，542，541，532，531，521，432，431，421，321。

[medie2005]

[code=C/C#include <iostream>
#include <iterator>

using namespace std;

void combination( int n, int m ){
int *A=new int[n+1], *B=new int[m+1];
int i, j;
for( i=1; i<=n; ++i ) A[i]=i;
for( i=1; i<=m; ++i ) B[i]=m;
while( B[1]<n ){
copy( A+1, A+m+1, ostream_iterator<int>(cout, " ") ),cout<<endl;
j=m;
while( B[j]==n )
--j;
++B[j];
for( i=j+1; i<=m; ++i )
B[i]=B[j];
swap( A[j], A[B[j]] );
}
copy( A+1, A+m+1, ostream_iterator<int>(cout, " ") ),cout<<endl;
delete []A; delete []B;
}

int main(int argc, char *argv[])
{
combination( 5, 3 );
return 0;
} [/code]

[HW121]

http://topic.csdn.net/u/20071119/14/abe5784c-3de5-4c07-b248-c29e3dc457ba.html

[medie2005]

上面的格式不好，再发一次：

#include   <iostream>
#include   <iterator>

using   namespace   std;

void     combination(   int   n,   int   m   ){
            int       *A=new   int[n+1],   *B=new   int[m+1];
            int       i,   j;
            for( i=1; i<=n; ++i )  A[i]=i;
            for( i=1; i<=m; ++i )  B[i]=m;
            while( B[1]<n ){
                   copy( A+1, A+m+1, ostream_iterator<int>(cout, "  ") ),cout<<endl;
                   j=m;
                   while( B[j]==n )
                          --j;
                   ++B[j];
                   for( i=j+1; i<=m; ++i )
                          B[i]=B[j];
                   swap( A[j], A[B[j]] );
            }
            copy( A+1, A+m+1, ostream_iterator<int>(cout, "  ") ),cout<<endl;
            delete   []A;     delete   []B;
}
           
int   main(int argc, char *argv[])
{
        combination( 5, 3 );
        return   0;
} 

[pptor]

http://topic.csdn.net/u/20071124/11/968809b3-12cd-455b-9f07-4c6938fa31fb.html

[lansedamo]

为什么不显示回复呢？

[lansedamo]

为什么我还是看不到我的答案。

[lansedamo]

谢谢大家