【回溯法】实现给定二进制位数的所有组合

#include <iostream>using namespace std;#define N 4int *x=new int[N];void backtrack(int t){int i=0;if(t>N-1) {for(i=0; i<N; i++)cout<<x[i]<<" ";cout<<endl;}else{for(i=0; i<=1; i++){x[t]=i;backtrack(t+1);}}}void main(){backtrack(0);}