Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <queue>
- #include <vector>
- #include <algorithm>
- #include <fstream>
- using namespace std;
- const int maxn = 2e5 + 10;
- int k;
- string to_bin(int n) {
- string s = "";
- while(n > 0) {
- s += (n % 2) + '0';
- n /= 2;
- }
- while(s.size() < k) {
- s += "0";
- }
- reverse(s.begin(), s.end());
- return s;
- }
- int pow_of_2(int x) {
- int ret = 1;
- for(int i = 0; i < x; i++) {
- ret *= 2;
- }
- return ret;
- }
- int main() {
- ios_base::sync_with_stdio(false);
- int n;
- cin >> n >> k;
- vector<string> v(k);
- for(int i = 0; i < k; i++) {
- cin >> v[i];
- }
- int E = pow_of_2(k);
- for(int bin = 0; bin < E; bin++) {
- string s = to_bin(bin);
- int cnt = 0;
- for(int i = 0; i < (int) s.size(); i++) {
- if(s[i] == '1') {
- cnt++;
- }
- }
- if(cnt == 2 * n) {
- vector<string> tmp;
- for(int i = (int) s.size() - 1; i >= 0; i--) {
- if(s[i] == '1') {
- tmp.push_back(v[k - i - 1]);
- }
- }
- }
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement
