Pro.ID22164 TitleC(n, m) again Title链接http://10.20.2.8/oj/exercise/problem?problem_id=22164 AC0 Submit2 Ratio0.00% 时间&空间限制描述This is a classical problem. Your job is to calculate the combination formula , since n, m and C(n, m) fit a 64-bit unsigned integer. 输入The first line of input there is one integer T ( T ≤ 100 ), giving the number of test cases in the input. Each test case contains a line with two integer n and m ( 0 ≤ m ≤ n < 264 ). 输出Description This is a classical problem. Your job is to calculate the combination formula , since n, m and C(n, m) fit a 64-bit unsigned integer. Input The first line of input there is one integer T ( T ≤ 100 ), giving the number of test cases in the input. Each test case contains a line with two integer n and m ( 0 ≤ m ≤ n < 264 ). Output For each case, output the answer C(n, m) corresponding to the input. Sample Input 1 Sample Output 6 Source 样例输入1 样例输出6 作者 |