### algo3rythm's blog

By algo3rythm, history, 2 weeks ago, ,

Please does anyone have an idea on how to solve the above-mentioned problem

Problem Statement

I've tried using the sum of the set bits and many others but all seem to be wrong

Please any hint/solution will be appreciated. Thanks.

• 0

By algo3rythm, history, 2 weeks ago, ,

Hi all,

I tried solving the above-mentioned problem

MY APPROACH

Binary search for the highest value that still keeps it in a true state

But I seem to be getting the Wrong Answer

• +8

By algo3rythm, history, 2 months ago, ,

Hello everyone,

Since yesterday I have been reading the above stated problem but am not still able to come up with a solution, I have seen the editorial but i don't understand the proof for the algorithm.

PROBLEM STATEMENT

Keeping an eye on long term career possibilities beyond the farm, Bessie the cow has started learning algorithms from various on-line coding websites. Her favorite algorithm thus far is "bubble sort". Here is Bessie's implementation, in cow-code, for sorting an array A of length N.

sorted = false
while (not sorted):
sorted = true
moo
for i = 0 to N-2:
if A[i+1] < A[i]:
swap A[i], A[i+1]
sorted = false


Apparently, the "moo" command in cow-code does nothing more than print out "moo". Strangely, Bessie seems to insist on including it at various points in her code.

Given an input array, please predict how many times "moo" will be printed by Bessie's code.

N<=100,000, each element being an integer in the range 0…10^9. Input elements are not guaranteed to be distinct.