본문 바로가기

1day 1coding/백준 단계별 문제

[백준/Java] 2480번: 주사위 세개

 

노가다성 문제를 끝으로.. 조건문 완료~!

 

import java.util.ArrayList;
import java.util.Collections;
import java.util.List;
import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		 Scanner scan = new Scanner(System.in);
		 
		 List<Integer> numberArr = new ArrayList<Integer>();
		 numberArr.add(scan.nextInt());
		 numberArr.add(scan.nextInt());
		 numberArr.add(scan.nextInt());
		 
		 Collections.sort(numberArr, Collections.reverseOrder());
		 
		 Integer num1 = numberArr.get(0);
		 Integer num2 = numberArr.get(1);
		 Integer num3 = numberArr.get(2);
		 
		 int prize = 0;
		 
		 if (num1 == num2) {
			 if (num2 == num3) {
				 prize = 10000 + (num1*1000);
			 } else {
				 prize = 1000 + (num1*100);
			 }
		 } else if (num1 == num3) {
			 if (num2 == num3) {
				 prize = 10000 + (num1*1000);
			 } else {
				 prize = 1000 + (num1*100);
			 }
		 } else if (num2 == num3) {
			 if (num1 == num2) {
				 prize = 10000 + (num1*1000);
			 } else {
				 prize = 1000 + (num2*100);
			 }
		 } else if ((num1 != num2) && (num2 != num3) && (num1 != num3)) {
			 prize = num1 * 100; 
		 }
		 System.out.println(prize);
		 
	}
	    
}