We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
Not really. The ncr is the key to get accepted. Not because it's hard, the truth is you have to cache the factorials and the inverse element of these factorials to make the ncr efficient enough.
Is that really necessary? Why not relaxing the time limit to make us happy? haha
Longest Increasing Subsequence Arrays
You are viewing a single comment's thread. Return to all comments →
Not really. The
ncris the key to get accepted. Not because it's hard, the truth is you have to cache the factorials and the inverse element of these factorials to make thencrefficient enough.Is that really necessary? Why not relaxing the time limit to make us happy? haha
Yeah, but still you gotta know how to use ncr for this problem first, and then gotta worry about computing it efficiently XD
I've been working so hard on the first one and feel totally depressed by the second one.
P.S. I don't quit coding...yet... :)