Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<bits/stdc++.h>
- using namespace std;
- int i,a[1000],dem=0,k,T,cnt,n[10000],h[10000];
- void show()
- {
- int j;
- dem=0;
- for(j=0;j<n[cnt];j++)
- {
- if(a[j]==1) {dem++;}
- }
- if(dem==h[cnt]) {for(j=0;j<n[cnt];j++) {cout<<a[j];} cout<<"\n";}
- }
- void back(int i)
- {
- if(i==n[cnt])
- {
- show();
- }
- else
- {
- a[i]=0;
- back(i+1);
- a[i]=1;
- back(i+1);
- }
- }
- int main()
- {
- cin>>T;
- for(cnt=0;cnt<=T-1;cnt++)
- { cout<<"\n";
- cin>>n[cnt]>>h[cnt];
- }
- for(cnt=0;cnt<T;cnt++)
- {
- back(0);
- cout<<"\n";
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement