OJ Board

nevermind... I got it. It has a O(number_of_zeros * number_of_ones) solution. Here are some extra cases if anyone might need them: Input: 1000 1000 1 1000 1000 298347928379879798798720 1000 1000 999999999999999999999999999999999 Output: Case 1: 1000 1 535754303593133660474212524530000905280702405852...

Any ideas on this one? Finding the minimum and the maximum is an easy task, but counting isn't. I thought about many DP approaches, but none seems to work. Any hints please?

I understood how to deduce the answer from the partial sums when K = 1, but I failed to generalize it for K > 1.
How can the binomial expansion help me here?

We choose some leaves and make sure every node could reach at least one of them.
(and choose some roots to make sure every node could be reached from them)

I don't quite understand what you mean by this, can you elaborate more please?

Thanks for your concern :) I'll let you know if I have some more comments. About the 'speed' issue. Using mozilla firefox the website loads pretty quick, it's only the statistics bar that takes time to load after the page is displayed. Using IE, the page isn't fully displayed untill all the image ba...

I agree with all of you, and I hope one of the new website admins read this. The new online judge is just great, specially now it supports java 1.6 and g++ 4.1.2 (No more unusual compilation errors 8) ), in addition, now with a single log-in I can submit many times without having to rewrite my ID. H...

Here's the test case that Andrian has mentioned: My program outputs (C, 3) and I keep getting WA.
Any more test cases plz?

any test cases plzz ??

but wouldn't the sqrt of a bignum need to be calculated using binary search as well ?? do u know an efficient implementation for calculating the sqrt of a bignum?? I've seen some algorithms such as "pell's equation", but binary search proves to be much faster...

The problem is all about writing the decode function.. the rest is straight forward. I'm getting TLE... Here's my decode function, which decodes a value 'p' into the corresponding row and column 'r' and 'c': void decode(type p, type& r, type& c) { type l = 0; type h = p + 1; while(1 < h - l)...

I think I totally failed to do the analysis, even after I found the source code which distributes the average value of (vb+vw-vr)/k, I didn't understand why this is correct. Any explanation plz ??

I think it would be fine, if we divide every volume (say starting from CXII) in 100 sections for every problem, then divide these sections in a few parts(for example WA, TLE). So, if somone have an error ERROR on problem PROBLEM, he must read the section PROBLEM->ERROR, and if that doesn't help, th...

but is the assumption that from the 2nd uptill the Kth rinse will use the same amount of water correct?

Still WA...
Correct me if I'm wrong, but I assume that all rinses use the same amount of water... except the first rinse which I use ternary search to calculate.

Thanks for your... uhh.. *cool* hint It made me realize that my old greedy solution wasn't correct.
It came to my mind to use ternary search, but I ended up getting WA (but your test data matched). Please see if you can post some more test cases.