11th multiple schools and 3944 HDU dp (Lucas theorem, modulo of large groups)

The question is to walk along the vertex (0, 0) of the Yang Hui triangle and go to (n, k). Only (I, j)-> (I + 1, J) or (I, j)-> (I + 1, J + 1) Calculate the sum of all numbers in the path and find the path with the smallest weight;

The path with the smallest weight must first walk n-k along 1 on the left or 1 on the right, and convert K> n/2 to n-k, because the weights of the two paths are the same, the sum shows that the answer is C (n + 1, k) + n-k;

See brother Lu's bloghttp: // www.earthson.net/. lacuscheck and promotion, and there are powerful templates.

I picked a point where p is a small prime number, but it is still slow in time, if it is a constant...