sclo wrote:There's no need to use big integers to solve this problem. The key is to find a recurrence for the multinomial coefficient involving only sums and/or products. It is guaranteed to not overflow.
You havent seen farzane's code. His/Her algorithm required big integers. But it doesnt mean that we are using big integers, too.