Submission #5285611

---

Source Code Expand

#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<string>
#include<string.h>
#include<math.h>
#include<stdlib.h>
#include<vector>
#include<queue>
#include<map>
#include<iomanip>
#include<set>
#define rep(index,num) for(int index=0;index<num;index++)
#define rep1(index,num) for(int index=1;index<=num;index++)
#define scan(argument) cin>>argument
#define prin(argument) cout<<argument<<endl
#define kaigyo cout<<endl
#define eps 1e-7
#define mp(a1,a2) make_pair(a1,a2)
typedef long long ll;
typedef long double ld;
using namespace std;
typedef pair<ll,ll> pll;
typedef pair<int,int> pint;
typedef vector<int> vint;
typedef vector<ll> vll;
typedef vector<pint> vpint;
typedef vector<pll> vpll;
ll INFl=1e+18+1;
int INF=1e+9+1;
int main(){
	int N,D;
	string S[101];
	scan(N>>D);
	rep(i,D){
		scan(S[i]);
	}
	int ans=0;
	rep(i,D){
		for(int j=i+1;j<D;j++){
			int sum=0;
			rep(k,N){
				if(S[i][k]=='o'||S[j][k]=='o'){
					sum++;
				}
			}
			ans=max(ans,sum);
		}
	}
	prin(ans);
	return 0;
}

Submission Info

Judge Result