Discussion @ 1862. Very Wealthy Mole @ Timus Online Judge

any hints?

Posted by d3m0n1c 28 Oct 2011 04:36

Re: any hints?

Posted by Noob 29 Oct 2011 00:39

http://oeis.org/

Re: any hints?

Posted by newquercitron 30 Oct 2011 01:34

it's a cheat! =)

Re: any hints?

Posted by Noob 30 Oct 2011 02:08

At least you should be able to write bruteforce in O(n^2 * 2^n) :)

Re: any hints?

Posted by aropan 31 Oct 2011 12:46

For a pair of numbers the number of actions is equal to <length of the first number> + <length of the second number> - 2*<length of the longest common prefix> (numbers are treated as binary strings)

READ !!!!

Posted by Tuit 26 Nov 2011 15:44

Bo`ladigan gap gapirgin-e!!!

Re: any hints?

Posted by IgorKoval(from Pskov) 22 May 2012 21:59

Your must understand hint of 'aropan'. And get answer = 2^L*(L - 3*2^L + L*2^L + 3)
P.S.: Mathcad can help you to find sum of such expression as FOR(z=0,..l)z*2^z. It's only math problem.
P.P.S.: To find 2^L use http://en.wikipedia.org/wiki/Exponentiation_by_squaring

Edited by author 22.05.2012 22:17

Re: any hints?

Posted by kostan3 19 Oct 2012 23:15

чё это????

Discussion of Problem 1862. Very Wealthy Mole