按照思路写:深搜,r控制位数,位数为0输出否则递归
/* Name: NYOJ--32--搜索--组合数 Date: 14/04/17 16:48 Description: 深度优先搜索 */#includeusing namespace std;int n,r;int arr[15];void dfs(int,int);int main(){ freopen("in.txt","r",stdin);// freopen("out.txt","a+",stdout); cin>>n>>r; arr[0] = r; dfs(n,r); return 0;}void dfs(int num,int ct){ for(int i=num; i>0; --i){ arr[r-ct] = i; if(ct > 1){ dfs(i-1,ct-1); }else{ for(int i=0; i