Dice Cup

/*
 * DiceCup Naive solution
 * Compute all sums and accumulate occorrences
 * Pedro Vasconcelos <pbv@dcc.fc.up.pt>, 2015
 */

import java.util.Scanner;

public class DiceCup {
    static int hist[];         // outcome histogram
    
    static void dice(int n, int m) {
	/* compute histogram and maximum frequency */
	int maxFreq = 0;
	hist = new int[n+m+1];  // default initialization (zeros)
	for (int i=1; i<=n; i++)
	    for (int j=1; j<=m; j++) {
		hist[i+j] ++;
		if(hist[i+j] > maxFreq)
		    maxFreq = hist[i+j];
	    }

	for (int s=2; s<=n+m; s++) {
	    if(hist[s] == maxFreq) 
		System.out.println(s);
	}
    }

    public static void main(String[] args) {
	Scanner sc = new Scanner(System.in);
	int n = sc.nextInt();
	int m = sc.nextInt();
	dice(n,m);
    }
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED

Test 11

Verdict: ACCEPTED

Test 12

Verdict: ACCEPTED

Test 13

Verdict: ACCEPTED

Test 14

Verdict: ACCEPTED

Test 15

Verdict: ACCEPTED

Test 16

Verdict: ACCEPTED

Test 17

Verdict: ACCEPTED

Test 18

Verdict: ACCEPTED

Test 19

Verdict: ACCEPTED

Test 20

Verdict: ACCEPTED

Test 21

Verdict: ACCEPTED

Test 22

Verdict: ACCEPTED

Test 23

Verdict: ACCEPTED

Test 24

Verdict: ACCEPTED

Test 25

Verdict: ACCEPTED