Hackerrank/acm-icpc-team.cpp at master · shklqm/Hackerrank · GitHub

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
67
68
69
70
71
#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;


int main() {

    int N, K;

    cin>>N>>K;


    string 		Topics[N];
    int temp = 0;
    int length = K*(K+1)/2;


    for(int i=0; i<N; i++)
    {
    	string s;
    	cin>>s;
    	Topics[i] = s;
    }

    int max = 0;

    for(int i=0; i< N - 1; i++)
    {
    	for(int j = i+1; j<N; j++)
    	{
    		for(int k=0; k<K; k++)
    		{
    			if(Topics[i][k] != '0' || Topics[j][k] != '0')
    				temp++;
    		}

    		if(temp>max)
    			max = temp;
    		temp = 0;
    	}

    }

    int result = 0;

    for(int i=0; i< N - 1; i++)
    {
    	for(int j = i+1; j<N; j++)
    	{
    		for(int k=0; k<K; k++)
    		{
    			if(Topics[i][k] != '0' || Topics[j][k] != '0')
    				temp++;
    		}

    		if(temp == max)
    			result++;

    		temp = 0;
    	}

    }

    cout<<max<<endl;
    cout<<result<<endl;

    return 0;
}