这道题目要求计算C(n, k)模10000003，通过杨辉三角的性质来实现。利用C(n, k) = C(n-1, k-1) + C(n-1, k)进行递推，先生成杨辉三角的部分表，然后根据给定的n和k计算结果。"
101346025,1392973,Cucumber入门与Gherkin语法详解,"['测试框架', 'Cucumber', 'BDD实践', '自动化测试', 'Gherkin语法']
1311.Binomial Coeffcients
Description
The binomial coefficientis
the number of ways of picking k unordered outcomes from n possibilities, also known as a combination or combinatorial number.
Give n and k, you are required to calculate mod 10000003.
The input contains several test cases. The first line of the input contains one positive integer, c, denoting the number of test cases.
Each of the following c lines contains two integers, n(0<=n<=1000) and k (0<=k<=n), denoting that you are required to calculate
最低0.47元/天 解锁文章
扫一扫
283
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
