Using Back Track Algorithm:
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 |
#include <iostream> #include <cstring> #include <cstdio> #include <string> #include <algorithm> using namespace std; int N,H; int backtrack(int idx,int cnt,int a[20]) { if(cnt==N-H) { for(int i=1;i<=N;i++) cout<<a[i]; cout<<"\n"; return 0; } for(int i=idx;i<=N;i++) { a[i]=0; backtrack(i+1,cnt+1,a); a[i]=1; } return 0; } int main() { int t; string s; cin>>t; getchar(); getline(cin,s); int str[20]; while(t--) { cin>>N; getchar(); cin>>H; getchar(); getline(cin,s); for(int i=0;i<20;i++) str[i]=1; backtrack(1,0,str); if(t) cout<<"\n"; } return 0; } |
Using Next_permutation() method in C++
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 |
#include <iostream> #include <cstring> #include <cstdio> #include <string> #include <algorithm> using namespace std; int N,H; int main() { int t; string s; cin>>t; getchar(); getline(cin,s); int str[20]; while(t--) { cin>>N; getchar(); cin>>H; getchar(); getline(cin,s); for(int i=0;i<N-H;i++) str[i]=0; for(int i=N-H;i<N;i++) str[i]=1; do{ for(int i=0;i<N;i++) cout<<str[i]; cout<<"\n"; } while(next_permutation(str,str+N)); if(t) cout<<"\n"; } return 0; } |