AcWing 886. 求组合数 I (排列组合)

第一节，各个数据范围都比较小，采用预处理，直接输出答案。
题目

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;

class Main {
    static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
    static PrintWriter pw = new PrintWriter(System.out);
    static int N = 2005, mod = (int) (1e9 + 7);
    static int c[][] = new int[N][N];

    public static void main(String[] args) throws IOException {

        for (int i = 0; i < N; i++)
            for (int j = 0; j <= i; j++)
                if (j == 0) c[i][j] = 1;
                else c[i][j] = (c[i - 1][j] + c[i - 1][j - 1]) % mod;


        String[] s = br.readLine().split(" ");
        int n = Integer.parseInt(s[0]);
        for (int i = 0; i < n; i++) {
            s = br.readLine().split(" ");
            int a = Integer.parseInt(s[0]);
            int b = Integer.parseInt(s[1]);
            pw.println(c[a][b]);
        }
        pw.flush();
        br.close();
    }
}