Submission #449552


Source Code Expand

import java.io.IOException;
import java.io.InputStream;
import java.util.*;

public class Main {




    void work() {
        FastScanner sc = new FastScanner(System.in);
        int n = sc.nextInt();
        int[]  a = new int[n];


        for (int i = 0; i < n; i++)
            a[i] = sc.nextInt();

        Arrays.sort(a);

        Set<Integer> set = new HashSet<Integer>();

        for (int i = 0; i < n; i++) {
            int j = a[i];
            while (j % 2 == 0) j = j/2;
            if (!set.contains(j))
                set.add(j);
        }

        System.out.println(set.size());

    }


    public static void main(String[] args) {
        new Main().work();
    }


    static class FastScanner {
        private InputStream inputStream;
        private byte[] buf = new byte[1024];
        private int curChar;
        private int numChar;



        public FastScanner(InputStream inputStream) {
            this.inputStream = inputStream;
        }


        public int next() {
            if (numChar == -1)
                throw new InputMismatchException();
            if (curChar >= numChar) {
                curChar = 0;
                try {
                    numChar = inputStream.read(buf);
                } catch (IOException e) {
                    throw new InputMismatchException();
                }
                if (numChar <=0)
                    return -1;
            }
            return buf[curChar++];
        }

        public int nextInt() {
            int ch = next();
            while (isSpace(ch))
                ch = next();

            int pn = 1;
            if (ch == '-') {
                pn = -1;
                ch = next();
            }

            int num = 0;

            do {
                if ( ch < '0' || ch > '9')
                    throw new InputMismatchException();
                num = num*10 + ch - '0';
                ch = next();
            } while (!isSpace(ch));
            return pn * num;
        }

        public boolean isSpace(int ch) {
            return ch == ' ' || ch == '\n' || ch == '\r' || ch == '\t' || ch == -1;
        }
    }
}

Submission Info

Submission Time
Task C - 高橋くんと魔法の箱
User rhd_s_2015_2808
Language Java (OpenJDK 1.7.0)
Score 100
Code Size 2241 Byte
Status AC
Exec Time 589 ms
Memory 37660 KB

Judge Result

Set Name Sample Subtask1 Subtask2 All
Score / Max Score 0 / 0 20 / 20 30 / 30 50 / 50
Status
AC × 3
AC × 23
AC × 13
AC × 43
Set Name Test Cases
Sample subtask0_0.txt, subtask0_1.txt, subtask0_2.txt
Subtask1 subtask1_0.txt, subtask1_1.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask1_2.txt, subtask1_3.txt, subtask1_4.txt, subtask1_5.txt, subtask1_6.txt, subtask1_7.txt, subtask1_8.txt, subtask1_9.txt, subtask0_0.txt, subtask0_1.txt, subtask0_2.txt
Subtask2 subtask2_0.txt, subtask2_1.txt, subtask2_2.txt, subtask2_3.txt, subtask2_4.txt, subtask2_5.txt, subtask2_6.txt, subtask2_7.txt, subtask2_8.txt, subtask2_9.txt, subtask0_0.txt, subtask0_1.txt, subtask0_2.txt
All subtask0_0.txt, subtask0_1.txt, subtask0_2.txt, subtask1_0.txt, subtask1_1.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask1_2.txt, subtask1_3.txt, subtask1_4.txt, subtask1_5.txt, subtask1_6.txt, subtask1_7.txt, subtask1_8.txt, subtask1_9.txt, subtask2_0.txt, subtask2_1.txt, subtask2_2.txt, subtask2_3.txt, subtask2_4.txt, subtask2_5.txt, subtask2_6.txt, subtask2_7.txt, subtask2_8.txt, subtask2_9.txt, subtask3_0.txt, subtask3_1.txt, subtask3_2.txt, subtask3_3.txt, subtask3_4.txt, subtask3_5.txt, subtask3_6.txt, subtask3_7.txt, subtask3_8.txt, subtask3_9.txt
Case Name Status Exec Time Memory
subtask0_0.txt AC 332 ms 20828 KB
subtask0_1.txt AC 333 ms 20816 KB
subtask0_2.txt AC 334 ms 20824 KB
subtask1_0.txt AC 355 ms 22220 KB
subtask1_1.txt AC 388 ms 25268 KB
subtask1_10.txt AC 359 ms 22556 KB
subtask1_11.txt AC 388 ms 24148 KB
subtask1_12.txt AC 399 ms 24552 KB
subtask1_13.txt AC 391 ms 24116 KB
subtask1_14.txt AC 379 ms 24996 KB
subtask1_15.txt AC 381 ms 24716 KB
subtask1_16.txt AC 379 ms 24540 KB
subtask1_17.txt AC 378 ms 24344 KB
subtask1_18.txt AC 378 ms 24840 KB
subtask1_19.txt AC 377 ms 23588 KB
subtask1_2.txt AC 369 ms 23144 KB
subtask1_3.txt AC 373 ms 23616 KB
subtask1_4.txt AC 379 ms 24256 KB
subtask1_5.txt AC 371 ms 24332 KB
subtask1_6.txt AC 380 ms 24936 KB
subtask1_7.txt AC 365 ms 23396 KB
subtask1_8.txt AC 378 ms 25072 KB
subtask1_9.txt AC 365 ms 22588 KB
subtask2_0.txt AC 509 ms 37660 KB
subtask2_1.txt AC 567 ms 36936 KB
subtask2_2.txt AC 584 ms 37032 KB
subtask2_3.txt AC 556 ms 37160 KB
subtask2_4.txt AC 566 ms 36984 KB
subtask2_5.txt AC 573 ms 37256 KB
subtask2_6.txt AC 582 ms 37392 KB
subtask2_7.txt AC 574 ms 37180 KB
subtask2_8.txt AC 570 ms 37148 KB
subtask2_9.txt AC 581 ms 37220 KB
subtask3_0.txt AC 513 ms 37572 KB
subtask3_1.txt AC 589 ms 37316 KB
subtask3_2.txt AC 587 ms 37324 KB
subtask3_3.txt AC 575 ms 37176 KB
subtask3_4.txt AC 572 ms 37212 KB
subtask3_5.txt AC 578 ms 37408 KB
subtask3_6.txt AC 572 ms 37280 KB
subtask3_7.txt AC 571 ms 37428 KB
subtask3_8.txt AC 566 ms 37240 KB
subtask3_9.txt AC 576 ms 37280 KB