@@ -0,0 +1,1354 @@
+//https://www.hackerrank.com/challenges/acm-icpc-team%0Aimport java.io.*;%0A%0Apublic class Solution %7B%0A%0A    public static void main(String%5B%5D args) throws IOException %7B%0A        %0A        //INPUT%0A        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));%0A        String input%5B%5D = br.readLine().split(%22 %22);%0A        short N = Short.parseShort(input%5B0%5D);%0A        short M = Short.parseShort(input%5B1%5D);%0A        byte%5B%5D%5B%5D topics = new byte%5BN%5D%5BM%5D;%0A        for(short i = 0; i %3C N; ++i)%7B%0A            char%5B%5D arr = br.readLine().toCharArray();%0A            for(int j = 0; j %3C M; ++j)%7B%0A                topics%5Bi%5D%5Bj%5D = (byte)(arr%5Bj%5D - '0');%0A            %7D%0A        %7D%0A        %0A        //SOLVE%0A        short numTeams = 0;%0A        short maxTopics = 0;%0A        for(short i = 0; i %3C N; ++i)%7B%0A            for(short j = (short)(i+1); j %3C N; ++j)%7B%0A                short numTopics = 0;%0A                for(short k = 0; k %3C M; ++k)%7B%0A                    numTopics += topics%5Bi%5D%5Bk%5D %7C topics%5Bj%5D%5Bk%5D;%0A                %7D%0A                if (maxTopics %3C numTopics)%7B%0A                    numTeams = 1;%0A                    maxTopics = numTopics;%0A                %7D else if(maxTopics == numTopics)%7B%0A                    ++numTeams;%0A                %7D%0A            %7D%0A        %7D%0A        %0A        //OUTPUT%0A        System.out.println(maxTopics);%0A        System.out.print(numTeams);%0A    %7D%0A%7D%0A

Create acm-icpc-team.java