You havent seen farzane's code. His/Her algorithm required big integers. But it doesnt mean that we are using big integers, too.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.
All about problems in Volume 9. If there is a thread about your problem, please use it. If not, create one with its number in the subject.
Moderator: Board moderators
Ami ekhono shopno dekhi...