func_code_string: #include <bits/stdc++.h>   using namespace std;   const double eps = 1e-10;   const int maxn = 100 + 10;   int n, m;   int a[maxn], b[maxn];   bitset<65> tt1[50000], tt2[50000];   vector<int> v;   map<int, int> mp;   int main() {     cin >> n >> m;     for (int i = 0; i < n; i++) cin >> a[i];     for (int i = 0; i < m; i++) cin >> b[i];     bitset<65> *t1 = tt1 + 25000, *t2 = tt2 + 25000;     for (int i = 0; i < n; i++) {       for (int j = 0; j < m; j++) {         t1[a[i] + b[j]][i] = 1;         t2[a[i] + b[j]][j] = 1;         if (!mp[a[i] + b[j]]) {           mp[a[i] + b[j]] = 1;           v.push_back(a[i] + b[j]);         }       }     }     int mine = -1;     for (int i = 0; i < v.size(); i++) {       for (int j = 0; j < v.size(); j++) {         int sum = (t1[v[i]] | t1[v[j]]).count() + (t2[v[i]] | t2[v[j]]).count();         if (sum > mine) mine = sum;       }     }     printf( %d n , mine);     return 0;   }   