/
ACMICPCTeam.cpp
66 lines (61 loc) · 1.27 KB
/
ACMICPCTeam.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
#include <map>
#include <set>
#include <list>
#include <cmath>
#include <ctime>
#include <deque>
#include <queue>
#include <stack>
#include <string>
#include <bitset>
#include <cstdio>
#include <limits>
#include <vector>
#include <climits>
#include <cstring>
#include <cstdlib>
#include <fstream>
#include <numeric>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <unordered_map>
using namespace std;
// https://www.hackerrank.com/challenges/acm-icpc-team/submissions/code/15493814
// play with string
int bothKnow(string s1, string s2){
int nTopics = 0;
for(int i = 0; i < s1.size(); ++i) {
if (s1[i] == '1' || s2[i] == '1') nTopics++;
}
return nTopics;
}
void solution(vector<string> topic) {
int max = 0;
int tmp;
int team = 0;
for (int i = 0; i < topic.size(); i++)
for (int j = i + 1; j < topic.size(); j++ )
{
tmp = bothKnow(topic[i], topic[j]); // or topic.at(i)
if (tmp > max) {
max = tmp;
team = 1;
} else if (max == tmp){
team += 1;
}
}
cout << max << endl;
cout << team << endl;
}
int main(){
int n;
int m;
cin >> n >> m;
vector<string> topic(n);
for(int topic_i = 0;topic_i < n;topic_i++){
cin >> topic[topic_i];
}
solution(topic);
return 0;
}