public static void main(String args[]){
        WinnerWithBeautifulNumber wwb = new WinnerWithBeautifulNumber();
        System.out.println(wwb.winner(37));
        System.out.println(wwb.winner(10));
    }
http://www.careercup.com/question?id=5399897561890816
Idea is simple. Count the number of times it takes to swap 0s such that all
1's are at least significant position.
e.g 1010 -> 1001 -> 101 -> 11
    1010  -> 110 -> 101 -> 11
    
No matter which route you take it leads to same result so just looking at swaps you can say
which player will win
src/com/interview/bits/WinnerWithBeautifulNumber.java