Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- using namespace std;
- int n,m,x;
- int main()
- {
- cin>>n>>m;
- int t[n][m];
- string ch;
- set<int> s;
- for(int i=0;i<n;i++)
- {
- cin>>ch;
- for(int j=0;i<m;j++)
- t[i][j]=ch[j]-'0';
- }
- for(int j=0;j<m;j++)
- {
- int maxi=-1, pos=0;
- for(int i=0;i<n;i++)
- if(t[i][j]>maxi)
- {
- pos=i;
- maxi=t[i][j];
- }
- s.insert(pos);
- for(int i=0;i<n;i++)
- if(t[i][j]==maxi)
- s.insert(i);
- }
- cout<<s.size()<<endl;
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement