結果

問題 No.520 プロジェクトオイラーへの招待
ユーザー hiromi_ayase
提出日時 2017-05-31 17:25:44
言語 Java
(openjdk 23)
結果
AC  
実行時間 625 ms / 4,000 ms
コード長 4,047 bytes
コンパイル時間 2,295 ms
コンパイル使用メモリ 77,716 KB
実行使用メモリ 40,540 KB
最終ジャッジ日時 2024-09-21 20:22:39
合計ジャッジ時間 3,832 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 7
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

import java.io.IOException;
import java.io.InputStream;
import java.util.NoSuchElementException;
public class Main {
  public static void main(String[] args) {
    FastScanner sc = new FastScanner();
    int N = sc.nextInt();
    
    for (int i = 0; i < N; i ++) {
      int a = sc.nextInt();
      int b = sc.nextInt();
      int c = sc.nextInt();
      System.out.println(solve(a, b, c));
    }
  }
  
  private static long mod = 1000000007;
  private static long solve(int a, int b, int c) {
    long ret = 0;
    ret += calc(a, b + c + 1);
    ret %= mod;
    ret += calc(b, c + a + 1);
    ret %= mod;
    ret += calc(c, a + b + 1);
    ret %= mod;
    
    for (int i = 0; i < a; i ++) {
      for (int j = 0; j < b; j ++) {
        for (int k = 0; k < c; k ++) {
          long now = 1;
          now *= calc(i + 1, j + 1);
          now %= mod;
          now *= calc(a - i, k + 1);
          now %= mod;
          now *= calc(b - j, c - k);
          now %= mod;
          
          ret += now;
          ret %= mod;
        }
      }
    }
    return ret;
  }
  private static long[][] dp = new long[301][301];
  private static long calc(int a, int b) {
    if (dp[a][b] > 0) return dp[a][b];
    if (a == 1 || b == 1) return 1;
    dp[a][b] = (calc(a - 1, b) + calc(a, b - 1)) % mod;
    return dp[a][b];
  }
}
class FastScanner {
  public static String debug = null;
  private final InputStream in = System.in;
  private int ptr = 0;
  private int buflen = 0;
  private byte[] buffer = new byte[1024];
  private boolean eos = false;
  private boolean hasNextByte() {
    if (ptr < buflen) {
      return true;
    } else {
      ptr = 0;
      try {
        if (debug != null) {
          buflen = debug.length();
          buffer = debug.getBytes();
          debug = "";
          eos = true;
        } else {
          buflen = in.read(buffer);
        }
      } catch (IOException e) {
        e.printStackTrace();
      }
      if (buflen < 0) {
        eos = true;
        return false;
      } else if (buflen == 0) {
        return false;
      }
    }
    return true;
  }
  private int readByte() {
    if (hasNextByte())
      return buffer[ptr++];
    else
      return -1;
  }
  private static boolean isPrintableChar(int c) {
    return 33 <= c && c <= 126;
  }
  private void skipUnprintable() {
    while (hasNextByte() && !isPrintableChar(buffer[ptr]))
      ptr++;
  }
  public boolean isEOS() {
    return this.eos;
  }
  public boolean hasNext() {
    skipUnprintable();
    return hasNextByte();
  }
  public String next() {
    if (!hasNext())
      throw new NoSuchElementException();
    StringBuilder sb = new StringBuilder();
    int b = readByte();
    while (isPrintableChar(b)) {
      sb.appendCodePoint(b);
      b = readByte();
    }
    return sb.toString();
  }
  public long nextLong() {
    if (!hasNext())
      throw new NoSuchElementException();
    long n = 0;
    boolean minus = false;
    int b = readByte();
    if (b == '-') {
      minus = true;
      b = readByte();
    }
    if (b < '0' || '9' < b) {
      throw new NumberFormatException();
    }
    while (true) {
      if ('0' <= b && b <= '9') {
        n *= 10;
        n += b - '0';
      } else if (b == -1 || !isPrintableChar(b)) {
        return minus ? -n : n;
      } else {
        throw new NumberFormatException();
      }
      b = readByte();
    }
  }
  public int nextInt() {
    return (int) nextLong();
  }
  public long[] nextLongList(int n) {
    return nextLongTable(1, n)[0];
  }
  public int[] nextIntList(int n) {
    return nextIntTable(1, n)[0];
  }
  public long[][] nextLongTable(int n, int m) {
    long[][] ret = new long[n][m];
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < m; j++) {
        ret[i][j] = nextLong();
      }
    }
    return ret;
  }
  public int[][] nextIntTable(int n, int m) {
    int[][] ret = new int[n][m];
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < m; j++) {
        ret[i][j] = nextInt();
      }
    }
    return ret;
  }
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0