OJ Board

can anyone tell me what input will let it wrong

Try Correct output: 18204270

is it over flower for long long int ?

The first factorial that can't fit in a long long is 21! = 2^65.47...

thanks to "mf" a lot

i have got ac

It's simple, just like Binomial Showdown(530)

You have t-n*p extra marks, and you have to distribute them among n subjects. That means you have t-n*p marks, and you should put n-1 'separators' to divide them into n pieces. Imagine marks as 0's and separators as 1's. Now the problem is: How many different binary numbers can be formed with n-1 1's and t-n*p 0's ? The answer is (t-n*p+n-1)!/{(t-n*p)!(t-n*p)!), simply C(t-n*p+n-1, t-n*p), or C(t-n*p+n-1, n-1).

Just build a Pascal's triangle with 75 rows, then go!

P.S. Big integer may be needed.

Got WA only for big int
in the problem why this is given ???
"You may assume that the final answer will fit in a standard 32-bit integer."

As far as I remember, I got this problem AC without using bigint.

i got wa in this code,but when i switched to java ,in same process i got ac
this is the wa code

I just submitted your code and it gets ACed.

"You may assume that the final answer will fit in a standard 32-bit integer." Is it true??!!

Yes, it is.

Yeah... Now I know that. Accepted!!!

Thanks for your reply..

I use unsigned int to get accepted. Although my first A.C. solution set -1 to an unsigned int , it still get accepted

I have solved this problem using DP , but i cant figure out how it become Binomial coefficient.