How to calculate nCr of long numbers

#1

I have figured that the answer will be (n+k-1)C(k-1) but i do not know how to calculate the nCr of large numbers .Please provide me with a hint.

#2

If modulo is a prime or product of a prime, you can use Lucas’ theorem.
You can check out this codechef link.

#3

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.