问题3733--DP?

3733: DP?

[命题人 : ]
时间限制 : 1.000 sec  内存限制 : 64 MB

提交

题目描述

Figure 1 shows the Yang Hui Triangle. We number the row from top to bottom 0,1,2,…and the column from left to right 0,1,2,….If using C(n,k) represents the number of row n, column k. The Yang Hui Triangle has a regular pattern as follows. C(n,0)=C(n,n)=1 (n ≥ 0) C(n,k)=C(n-1,k-1)+C(n-1,k) (0

输入

Input to the problem will consists of series of up to 100000 data sets. For each data there is a line contains three integers n, k(0<=k<=n<10^9) p(p<10^4 and p is a prime) . Input is terminated by end-of-file.

输出

For every test case, you should output "Case #C: " first, where C indicates the case number and starts at 1.Then output the minimum sum mod p.

样例输入 Copy 

1 1 2
4 2 7

样例输出 Copy 

Case #1: 0
Case #2: 5

来源/分类

2011 Multi-University Training Contest 11 - Host by UESTC 
提交