๐ŸŒท๐ŸŒผ๋ชจ์—ฌ๋ด์š” ๊ฐœ๋ฐœ์˜์ˆฒ๐ŸŒท๐ŸŒผ

[JAVA/์ฝ”๋”ฉํ…Œ์ŠคํŠธ] ์ž„์‹œ๋ฐ˜์žฅ ๋ณธ๋ฌธ

๊ฐœ๋ฐœ/์•Œ๊ณ ๋ฆฌ์ฆ˜ ๋ฌธ์ œํ’€์ด JAVA

[JAVA/์ฝ”๋”ฉํ…Œ์ŠคํŠธ] ์ž„์‹œ๋ฐ˜์žฅ

์š”์ผ์ด 2021. 5. 4. 01:48
๋ฐ˜์‘ํ˜•


import java.util.*;

public class Main {

    public static void solution(int input, int[][] array){

        int result = 0;
        int max = 0;

        for(int i=0; i<input; i++){
            int cnt = 0;
            for(int j=0; j<input; j++){
                if(i!=j){
                    for(int z=0; z<5; z++){
                        if(array[i][z] == array[j][z]){
                            cnt ++;
                            break;
                        }
                    }
                }
            }
            if(max < cnt){
                max = cnt;
                result = i;
            }
        }

        System.out.println(result + 1);

    }

    public static void main(String[] args) {

        Main main = new Main();
        Scanner kb = new Scanner(System.in);

        int input = kb.nextInt();

        int[][] array = new int[input][5];

        for(int i=0; i<input; i++){
            for(int j=0; j<5; j++){
                array[i][j] = kb.nextInt();
            }
        }

        Main.solution(input, array);
    }

}
Comments