func_code_string: #include <bits/stdc++.h>   using namespace std;   int dr1[] = {1, 1, 0, -1, -1, -1, 0, 1};   int dc1[] = {0, 1, 1, 1, 0, -1, -1, -1};   int dr[] = {1, -1, 0, 0};   int dc[] = {0, 0, 1, -1};   const int fx[] = {+1, -1, +0, +0};   const int fy[] = {+0, +0, +1, -1};   const int fx8[] = {+0, +0, +1, -1, -1, +1, -1, +1};   const int fy8[] = {-1, +1, +0, +0, +1, +1, -1, -1};   const int kx[] = {-2, -2, -1, -1, 1, 1, 2, 2};   const int ky[] = {-1, 1, -2, 2, -2, 2, -1, 1};   int Set(int N, int pos) { return N = N | (1 << pos); }   int reset(int N, int pos) { return N = N & ~(1 << pos); }   bool check(int N, int pos) { return (bool)(N & (1 << pos)); }   int x[10005];   int y[10005];   char d[10005][10005];   int main() {     ios_base::sync_with_stdio(false);     cin.tie(NULL);     long long a, b, c = 0, i, j, k, n, m, ans = 0;     string s[10005];     cin >> n >> m;     for (__typeof(n - 1) i = (0); i <= (n - 1); i++) {       cin >> s[i];     }     for (__typeof(n - 1) i = (0); i <= (n - 1); i++) {       bool wasbest = false;       for (__typeof(m - 1) j = (0); j <= (m - 1); j++) {         bool isbest = true;         a = s[i][j] -  0 ;         for (__typeof(n - 1) k = (0); k <= (n - 1); k++)           if (s[k][j] -  0  > a) isbest = false;         if (isbest) wasbest = true;       }       if (wasbest) ans++;     }     cout << ans << endl;     return 0;   }   