[백준 알고리즘] 2562번 최댓값(Python 3, Java)

 

<Python 3>

a = list()
for i in range(9):
    a.append(int(input()))
print(max(a), a.index(max(a))+1)

 

<Java>

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;

public class Main {
    public static void main(String[] args) throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        int max = 0;
        int max_idx = 0;
        for(int i=0; i<9; i++){
            int num = Integer.parseInt(br.readLine());
            if(num>max){
                max = num;
                max_idx = i+1;
            }
        }
        System.out.println(max+"\n"+max_idx);
    }
}

 

▼링크

https://www.acmicpc.net/problem/2562

2562번: 최댓값