Discussion @ 1862. Very Wealthy Mole @ Timus Online Judge

d3m0n1c any hints? [7] // Problem 1862. Very Wealthy Mole 28 Oct 2011 04:36

Noob Re: any hints? [3] // Problem 1862. Very Wealthy Mole 29 Oct 2011 00:39

http://oeis.org/

newquercitron Re: any hints? [1] // Problem 1862. Very Wealthy Mole 30 Oct 2011 01:34

it's a cheat! =)

Noob Re: any hints? // Problem 1862. Very Wealthy Mole 30 Oct 2011 02:08

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

kostan3 Re: any hints? // Problem 1862. Very Wealthy Mole 19 Oct 2012 23:15

чё это????

Aleksey Ropan Re: any hints? [1] // Problem 1862. Very Wealthy Mole 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)

Tuit READ !!!! // Problem 1862. Very Wealthy Mole 26 Nov 2011 15:44

Bo`ladigan gap gapirgin-e!!!

IgorKoval [PskovSU] Re: any hints? // Problem 1862. Very Wealthy Mole 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

Discussion of Problem 1862. Very Wealthy Mole