How to solve code jam Practice Round APAC test 2017 question 4 "sum of sums "using binary search".pls guys help me out link to the question:https://code.google.com/codejam/contest/5254486/dashboard#s=p3 does a segment tree solution to the problem exist pls elaborate a little bit cause i am a noob
Hope this helps : https://www.quora.com/How-can-problem-D-Sums-of-sums-from-Round-E-of-the-Google-APAC-Test-2016-be-solved-for-the-large-dataset
http://www.codeforces.com/blog/entry/45673?#comment-302487
How to solve problem C ?
Take out probability of i th bit being 1 multiply it with 2i and sum over all bits