Unexpected helphull problem

Posted by

svr 27 Oct 2009 10:45

During 3 days I couldn’t find appropriate way

to work with big binomials having lost of order

or overflow. Simple and clever routine was found and

gave satisfaction.

Re: Unexpected helphull problem

Re: Unexpected helphull problem

Could you give any hint: what kind of "simple routine" have you found? I also have got overflow / lost of order? Is it possible to avoid such problem in O(N^2) solution?

Re: Unexpected helphull problem

I don't know what your algo is, but my dynamic O(N^2) solution hasn't problems with overflows - all numbers is of order N

Re: Unexpected helphull problem

Thanks! I've got AC with O(N^2) DP. Every value was not exceeding N. But it's still interesting - how did some people get AC with 0.015sec and minimum of memory.

Re: Unexpected helphull problem