BOJ1233 주사위

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

1233번: 주사위

 

\

import java.util.*;
import java.io.*;
public class Main
{
	public static void main(String[] args) {
	    Scanner sc = new Scanner(System.in);
		int s1= sc.nextInt();
		int s2= sc.nextInt();
		int s3= sc.nextInt();
        
        int[] nums = new int[s1+s2+s3+1];
        
        for(int i=1; i<s1+1;i++){
            for(int j=1; j<s2+1;j++){
                for(int k=1; k<s3+1; k++){
                    nums[i+j+k]++;
                }
            }
        }
        int maxIndex=0;
        for(int i=0; i<nums.length;i++){
            if(nums[i]>nums[maxIndex]) maxIndex=i;
            
        }
        
        System.out.println(maxIndex);
        
        
	}
}