Submission #346490

Source Code Expand

import java.util.HashSet;
import java.util.Scanner;

public class Main {
    static HashSet<Integer> hs = new HashSet<Integer>();
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        //Scanner sc = new Scanner("4\n2 3 5 7");
        int n = sc.nextInt();
        for (int i = 0; i < n; i++) {
            int j = sc.nextInt();
            hs.add(j);
        }
        
        
        int count = 0;
        for (int i : hs) {
            if (hs.contains(i * 2)) {
                count++;
            }
        }
        System.out.println(hs.size()-count);
    }
}

Submission Info

Submission Time
Task C - 高橋くんと魔法の箱
User ekranoplan
Language Java (OpenJDK 1.7.0)
Score 0
Code Size 637 Byte
Status WA
Exec Time 1515 ms
Memory 43848 KiB

Judge Result

Set Name Sample Subtask1 Subtask2 All
Score / Max Score 0 / 0 0 / 20 0 / 30 0 / 50
Status
AC × 3
AC × 14
WA × 9
AC × 4
WA × 9
AC × 16
WA × 27
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 548 ms 23220 KiB
subtask0_1.txt AC 482 ms 23276 KiB
subtask0_2.txt AC 489 ms 23232 KiB
subtask1_0.txt AC 614 ms 27732 KiB
subtask1_1.txt WA 625 ms 28332 KiB
subtask1_10.txt AC 626 ms 27784 KiB
subtask1_11.txt AC 633 ms 28192 KiB
subtask1_12.txt AC 634 ms 27944 KiB
subtask1_13.txt AC 644 ms 28032 KiB
subtask1_14.txt AC 640 ms 28976 KiB
subtask1_15.txt AC 615 ms 28156 KiB
subtask1_16.txt AC 625 ms 28120 KiB
subtask1_17.txt AC 627 ms 28408 KiB
subtask1_18.txt AC 645 ms 28736 KiB
subtask1_19.txt AC 635 ms 28192 KiB
subtask1_2.txt WA 626 ms 27852 KiB
subtask1_3.txt WA 632 ms 28376 KiB
subtask1_4.txt WA 646 ms 28756 KiB
subtask1_5.txt WA 640 ms 28288 KiB
subtask1_6.txt WA 640 ms 28332 KiB
subtask1_7.txt WA 643 ms 28964 KiB
subtask1_8.txt WA 645 ms 28224 KiB
subtask1_9.txt WA 632 ms 28256 KiB
subtask2_0.txt AC 1029 ms 42816 KiB
subtask2_1.txt WA 1030 ms 42116 KiB
subtask2_2.txt WA 1022 ms 42580 KiB
subtask2_3.txt WA 1033 ms 42652 KiB
subtask2_4.txt WA 1048 ms 42920 KiB
subtask2_5.txt WA 1056 ms 42480 KiB
subtask2_6.txt WA 1106 ms 42736 KiB
subtask2_7.txt WA 1035 ms 42688 KiB
subtask2_8.txt WA 1039 ms 42824 KiB
subtask2_9.txt WA 1037 ms 42616 KiB
subtask3_0.txt AC 1515 ms 42412 KiB
subtask3_1.txt WA 1084 ms 43848 KiB
subtask3_2.txt WA 1086 ms 43412 KiB
subtask3_3.txt WA 1108 ms 43536 KiB
subtask3_4.txt WA 1076 ms 43244 KiB
subtask3_5.txt WA 1098 ms 43628 KiB
subtask3_6.txt WA 1082 ms 43412 KiB
subtask3_7.txt WA 1081 ms 43280 KiB
subtask3_8.txt WA 1084 ms 43676 KiB
subtask3_9.txt WA 1048 ms 42632 KiB