ACWing 93. 递归实现组合型枚举

#include
using namespace std;

int n,m;
void dfs(int u,int sum,int state)
{
    if(sum+n-u>i&1)
        cout<>n>>m;
    dfs(0,0,0);
    

    return 0;
}