Submission #346940

---

Source Code Expand

import java.util.Scanner;
import java.util.TreeSet;

/**
 * Created by bohnen on 2015/02/28.
 */
public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        TreeSet<Integer> set = new TreeSet<>();
        for(int i=0;i<n;i++){
            int x = sc.nextInt();
            set.add(div2(x));
        }
        System.out.println(set.size());
    }

    public static int div2(int x){
        if((x & 1) == 1)
            return x;
        return div2(x / 2);
    }
}

Submission Info

Judge Result