5 solutions
-
1
#include<bits/stdc++.h> using namespace std; int n,m; vector<vector<int>> v; int main() { cin>>n>>m; for(int i=1;i<1<<n;i++) { bitset<32> a(i); if(a.count()==m) { vector<int> t; for(int j=0;j<n;j++) { if(a[j]==1) { t.push_back(j+1); } } v.push_back(t); } } sort(v.begin(),v.end()); for(auto i:v) { for(auto k:i) { cout<<k<<" "; } cout<<endl; } return 0; }
Information
- ID
- 232
- Time
- 1000ms
- Memory
- 256MiB
- Difficulty
- 3
- Tags
- # Submissions
- 73
- Accepted
- 19
- Uploaded By