组合算法递归实现（C++）

#include 
#include 

using namespace std;

void f(int m, vector vec, vector& sd, size_t& count)
{
    if (m == 1)
    {
        for (int i = 0; i temp;
            for (int j = i + 1; j vec;
    for (int i = 0; i sd;
    size_t count = 0;

    f(atoi(argv[2]), vec, sd, count);

    return 0;
}