MARBLES two test cases failing

#1

using dp to calculate n-1 C k-1 unable to know whats wrong in the approach please help

#2

your approach maybe right.
but the answer wont fix in 64 bit integer value while calculating .
so you multiply and divide at the same time while calculating the answer.
nCk=(nn-1n-2…n-k+1)/(123…*k).
continuosly multiply and divide at each iteration in a loop.

#3

BigInteger m toh fit hoga??

#4


this is implementation of what i explained.it is giving AC.