Skip to content

Instantly share code, notes, and snippets.

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.net.HttpURLConnection;
import java.net.URL;
import java.nio.charset.StandardCharsets;
import java.util.regex.Matcher;
import java.util.regex.Pattern;
public class Sample {
public class ChangingChange {
private final long MOD = 1000000007;
private final int MAX = 1003000;
private long[] fact, factInv;
public int[] countWays(int[] ways, int[] valueRemoved, int[] numRemoved) {
fact = Mod.factorialArray(MAX, MOD);
factInv = Mod.factorialInverseArray(MAX, MOD,
Mod.inverseArray(MAX, MOD));
@kenkoooo
kenkoooo / ChangingChange.java
Last active August 29, 2015 14:25
O(N^3)のDP
public class ChangingChange {
private final long MOD = 1000000007;
private final int MAX = 1003000;
private long[] fact, factInv;
public int[] countWays(int[] ways, int[] valueRemoved, int[] numRemoved) {
fact = Mod.factorialArray(MAX, MOD);
factInv = Mod.factorialInverseArray(MAX, MOD,
Mod.inverseArray(MAX, MOD));