从N个元素中取k个元素子集的c++实现

#include <iostream>
#include <vector>

using namespace std;

int C( int n, int m)           //计算组合数
  {
    if ( n == 0 )
      return 1;
    int res = 1;
    int temp = m - n;
    for( int i = m; i != temp; --i )
      res *= i;
    for( int j = n; j > 1; --j )
      res /= j;
    return res;
  }

int main()
  {
        const int N = 8;
        int Array[] = { 1, 2, 3, 4, 5, 6 ,7 ,8 };
        //cout << "Please enter the array" << endl;
        //for (int i1 = 0; i1 < N; cin >> Array[i1++]);
        //for( int a = 0; a < N; ++a )
                //cout << Array[a] << endl;
        cout << "Please input K" << endl;
        int K;
        cin >> K;
        int num = C( K, N );