Submission #4020433


Source Code Expand

import java.util.*;

class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int n = Integer.parseInt(scanner.nextLine());
        long[] arr = new long[n];
        for (int i = 0; i < n; i++) {
            arr[i] = Long.parseLong(scanner.nextLine());
        }

        int[] numDivider = new int[n];
        for (int i = 0; i < n; i++) {
            int num = 0;
            for (int j = 0; j < n; j++) {
                if (i != j && arr[i] % arr[j] == 0) {
                    num++;
                }
            }
            numDivider[i] = num;
        }

        double result = 0.0;
        for (int i = 0; i < n; i++) {
            if (numDivider[i] % 2 == 0) {
                result += (double)(numDivider[i] + 2) / (double)(2 * numDivider[i] + 2);
            } else {
                result += 0.5;
            }
        }
        System.out.println(result);
    }
}

Submission Info

Submission Time
Task C - コイン
User k0kubun
Language Java8 (OpenJDK 1.8.0)
Score 100
Code Size 975 Byte
Status AC
Exec Time 103 ms
Memory 23636 KB

Judge Result

Set Name Sample Subtask1 Subtask2
Score / Max Score 0 / 0 99 / 99 1 / 1
Status
AC × 3
AC × 20
AC × 40
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt
Subtask1 subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.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_20.txt
Subtask2 subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.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_20.txt, subtask2_01.txt, subtask2_02.txt, subtask2_03.txt, subtask2_04.txt, subtask2_05.txt, subtask2_06.txt, subtask2_07.txt, subtask2_08.txt, subtask2_09.txt, subtask2_10.txt, subtask2_11.txt, subtask2_12.txt, subtask2_13.txt, subtask2_14.txt, subtask2_15.txt, subtask2_16.txt, subtask2_17.txt, subtask2_18.txt, subtask2_19.txt, subtask2_20.txt
Case Name Status Exec Time Memory
sample_01.txt AC 97 ms 18772 KB
sample_02.txt AC 95 ms 21844 KB
sample_03.txt AC 96 ms 21716 KB
subtask1_01.txt AC 96 ms 20948 KB
subtask1_02.txt AC 97 ms 21588 KB
subtask1_03.txt AC 94 ms 18768 KB
subtask1_04.txt AC 98 ms 19792 KB
subtask1_05.txt AC 98 ms 19540 KB
subtask1_06.txt AC 96 ms 23636 KB
subtask1_07.txt AC 96 ms 21716 KB
subtask1_08.txt AC 98 ms 23636 KB
subtask1_09.txt AC 97 ms 19540 KB
subtask1_10.txt AC 95 ms 18644 KB
subtask1_11.txt AC 97 ms 18768 KB
subtask1_12.txt AC 97 ms 19156 KB
subtask1_13.txt AC 98 ms 19540 KB
subtask1_14.txt AC 95 ms 19412 KB
subtask1_15.txt AC 96 ms 21844 KB
subtask1_16.txt AC 95 ms 21076 KB
subtask1_17.txt AC 97 ms 21716 KB
subtask1_18.txt AC 98 ms 21588 KB
subtask1_19.txt AC 97 ms 21204 KB
subtask1_20.txt AC 96 ms 18900 KB
subtask2_01.txt AC 96 ms 18644 KB
subtask2_02.txt AC 103 ms 21588 KB
subtask2_03.txt AC 98 ms 21716 KB
subtask2_04.txt AC 99 ms 19412 KB
subtask2_05.txt AC 100 ms 21844 KB
subtask2_06.txt AC 100 ms 19924 KB
subtask2_07.txt AC 98 ms 19924 KB
subtask2_08.txt AC 101 ms 19284 KB
subtask2_09.txt AC 100 ms 19796 KB
subtask2_10.txt AC 100 ms 20692 KB
subtask2_11.txt AC 100 ms 21844 KB
subtask2_12.txt AC 101 ms 21972 KB
subtask2_13.txt AC 100 ms 18772 KB
subtask2_14.txt AC 103 ms 18900 KB
subtask2_15.txt AC 100 ms 21844 KB
subtask2_16.txt AC 102 ms 19028 KB
subtask2_17.txt AC 100 ms 20948 KB
subtask2_18.txt AC 99 ms 18900 KB
subtask2_19.txt AC 102 ms 21204 KB
subtask2_20.txt AC 101 ms 21844 KB