On Jul 1, 6:46 am, vicky <mehta...@gmail.com> wrote: > It took me more time to understand this problem then solving after i > understood. > You guys too have a look @ it.:::::::::::::::::: > Let f(k) = y where k is the y-th number in the increasing sequence of > non-negative > integers with the same number of ones in its binary representation as > y, e.g. f(0) = 1, f(1) => 1, f(2) = 2, f(3) = 1, f(4) = 3, f(5) = 2, f(6) = 3 > and so on. > Given k >= 0, compute f(k).
There must be a mistake in you problem statement or examples. It only makes sense if you change it as follows: Let f(k) = y where k is the y-th number in the increasing sequence of non-negative integers with the same number of ones in its binary representation as k, <<-- change this from y to k. -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algoge...@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
