OJ Board

Great, thanks!

M[j] = the total number of combinations that make up the value (i+1) * 5c, with denominations[j] as the maximum possible denomination used in those combinations (so it also includes the combinations consisting of only lesser denominations).

My answer to 147 seems to get the correct answers for the sample questions and other small tests of mine.... I keep getting WA though. Can someone please help me?
[java]
/* @JUDGE_ID: 26309AF 147 Java */

import java.io.*;
import java.util.*;

class Main {

// code to read string from stdin without ...