Hamming distance of list fixed by rotary-o

import java.util.*;enum M{M;System z;int i,r,a,n;{for(Scanner s=new Scanner(z.in);s==s;z.out.println(r/9))for(i=r=0;i++<10;r+=~(n^n-1)/~n)n=a^(a=s.nextInt());}}

Note that non-ascii characters in the above source code will be escaped (such as \x9f).

To protect the system from spam, please input your favorite sport (hint: I believe its name must start with 'g', case insensitive)


return to the top page