func_code_string: #include <bits/stdc++.h>   using namespace std;   const int N = 60;   map<double, int> p;   bitset<N * N> g[N * N + 5];   int n, m;   double ya[N + 5], yb[N + 5];   int main() {     scanf( %d%d , &n, &m);     for (int i = 1; i <= n; i++) scanf( %lf , &ya[i]);     for (int i = 1; i <= m; i++) scanf( %lf , &yb[i]);     int tot = 0;     for (int i = 1; i <= n; i++) {       for (int j = 1; j <= m; j++) {         double now = (ya[i] + yb[j]) / 2;         if (p.find(now) == p.end()) tot++, p[now] = tot;         g[p[now]].set(i, 1);         g[p[now]].set(j + n, 1);       }     }     int ans = -1;     for (int i = 1; i <= tot; i++) {       for (int j = i; j <= tot; j++) {         bitset<N * N> s;         s = g[i] | g[j];         ans = max(ans, (int)s.count());       }     }     printf( %d n , ans);     return 0;   }   