thx. 那求助为什么 20分 qwq

#include "bits/stdc++.h"
using namespace std;

int Fr(string qwq) {
	int s = 0;
	for (int i = 0; i < qwq.size(); ++i) {
		s = s * 2 + qwq[i] - 48;
	}
	return s;
}

string Fp(int qwq) {
	if (qwq < 2) {
		if (qwq == 1) return "1";
		else return "0";
	}
	string s = Fp(qwq / 2) + char((qwq % 2) + 48);
	return s;
}

int chk(string Basic, string Ygg) {
	int ret = 0;
	for (int i = 0; i < Ygg.size(); ++i)
		if (Basic[i] != Ygg[i]) ++ret;
	return ret;
}

map<int, int> mp;

int f[131500];

int main() {
	int M, N, Basic, q;
	scanf ("%d%d", &M, &N);
	string pp;
	cin >> pp;
	Basic = Fr(pp);
	for (int i = 1; i <= 131072; ++i) f[i] = 0x3f3f3f3f;
	f[0] = 0;
	for (int i = 1; i <= N; ++i) {
		string p;
		cin >> p;
		q = Fr(p);
//		cout<<q<<endl;
		mp[q] = 1;
		f[q] = min(f[q], 1);
		for (int i = 0; i <= (1 << (M + 1)) - 1; ++i)
			if (f[i] != 0x3f3f3f3f) f[i ^ q] = min(f[i ^ q], f[i] + 1);
	}
//	cout<<f[28]<<endl;
//	cout<<Fp(28)<<endl;
	int gg = 0x3f3f3f3f, o, Mark = 0x3f3f3f3f;
	for (int i = 1; i <= ((1 << (M + 1)) - 1); ++i)
		if (f[i] != 0x3f3f3f3f) {
			if (chk(Fp(i), pp) < gg || (chk(Fp(i), pp) == gg && f[i] < Mark)) {
				gg = chk(Fp(i), pp);
				o = i;
				Mark = f[i];
			}
		} 
	cout << Mark - 1 << endl;
	cout << Fp(o) << endl;
	if (mp[o] == 1) cout << "Yes";
	else cout << "No";
}