10/17 NOIP模拟赛
期望得分:50;实际得分:0;
考场思路:暴力(完全没有往贪心的方面想,还差点把ssj带沟里 qwq)
拿到数据发现,这样写暴力完全不对啊。。。。
很多情况没有考虑到 qwq
#include <algorithm> #include <iostream> #include <cstring> #include <cstdio> using namespace std; const int M = 1005; int n, len, sum; int p, q, maxn; char s[M][M]; int main() { // freopen("curse.in","r",stdin); // freopen("curse.out","w",stdout); scanf("%d", &n); for (int i = 1; i <= n; ++i) { cin >> s[i]; len = strlen(s[i]); } for (int i = 1; i <= n; ++i) for (int j = i + 1; j <= n; ++j) { for (int k = 0; k < len; ++k) if (s[i][k] == s[j][k]) ++sum; if (sum > maxn) { maxn = sum; p = i, q = j; } sum = 0; } int y = 0, x = 0; for (int i = 0; i < len; ++i) { if (s[p][i] == '0') ++x; if (s[q][i] == '0') ++y; } if (x > y) cout << s[p] << '\n'; else cout << s[q] << '\n'; // fclose(stdin); fclose(stdout); return 0; }