Submission #1774183


Source Code Expand

import java.util.*;
import java.io.*;

public class Main {
    private static IO io = new IO();

    public static void main(String[] args) {
        int n = io.nextInt();
        int c[] = new int[n];
        for (int i=0; i<n; i++) c[i] = io.nextInt();

        double ans = 0;
        for (int i = 0; i < n; i++) {
            int S = 0;
            for (int j=0; j<n; j++) if (c[i]%c[j]==0) S++;
            if (--S%2==1) ans += 0.5;
            else ans += (double)(S+2)/(2*S+2);
        }
        System.out.println(ans);
    }

    static class IO extends PrintWriter {
        private final InputStream in;
        private final byte[] buffer = new byte[1024];
        private int ptr = 0;
        private int buflen = 0;

        IO() {
            this(System.in);
        }

        IO(InputStream source) {
            super(System.out);
            this.in = source;
        }

        boolean hasNextByte() {
            if (ptr < buflen) return true;
            else {
                ptr = 0;
                try {
                    buflen = in.read(buffer);
                } catch (IOException e) {
                    e.printStackTrace();
                }
                if (buflen <= 0) return false;
            }
            return true;
        }
        int readByte() {
            if (hasNextByte()) return buffer[ptr++];
            else return -1;
        }
        boolean isPrintableChar(int c) {return 33<=c &&c <=126;}
        void skipUnprintable() {while(hasNextByte() && !isPrintableChar(buffer[ptr]))ptr++;}
        boolean hasNext() {
            skipUnprintable();
            return hasNextByte();
        }

        long nextLong() {
            if (!hasNext()) throw new NoSuchElementException();
            long n = 0;
            boolean minus = false;
            int b = readByte();
            if (b == '-') {
                minus = true;
                b = readByte();
            }
            if (b < '0' || '9' < b) throw new NumberFormatException();
            while (true) {
                if ('0' <= b && b <= '9') {
                    n *= 10;
                    n += b - '0';
                } else if (b == -1 || !isPrintableChar(b)) return minus ? -n : n;
                else throw new NumberFormatException();
                b = readByte();
            }
        }

        int nextInt() {
            long nl = nextLong();
            if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();
            return (int) nl;
        }

        public void close() {
            super.close();
            try {
                in.close();
            } catch (IOException ignored) {
            }
        }
    }
}

Submission Info

Submission Time
Task C - コイン
User creep04
Language Java8 (OpenJDK 1.8.0)
Score 100
Code Size 2811 Byte
Status AC
Exec Time 80 ms
Memory 23124 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 76 ms 21204 KB
sample_02.txt AC 75 ms 20308 KB
sample_03.txt AC 74 ms 17876 KB
subtask1_01.txt AC 75 ms 20052 KB
subtask1_02.txt AC 73 ms 18132 KB
subtask1_03.txt AC 75 ms 19540 KB
subtask1_04.txt AC 75 ms 20308 KB
subtask1_05.txt AC 78 ms 20180 KB
subtask1_06.txt AC 76 ms 18004 KB
subtask1_07.txt AC 78 ms 20052 KB
subtask1_08.txt AC 79 ms 21204 KB
subtask1_09.txt AC 77 ms 19540 KB
subtask1_10.txt AC 77 ms 20692 KB
subtask1_11.txt AC 74 ms 19412 KB
subtask1_12.txt AC 77 ms 21076 KB
subtask1_13.txt AC 77 ms 19668 KB
subtask1_14.txt AC 78 ms 19412 KB
subtask1_15.txt AC 76 ms 20052 KB
subtask1_16.txt AC 79 ms 21076 KB
subtask1_17.txt AC 79 ms 21204 KB
subtask1_18.txt AC 78 ms 20820 KB
subtask1_19.txt AC 76 ms 21204 KB
subtask1_20.txt AC 79 ms 20948 KB
subtask2_01.txt AC 77 ms 21076 KB
subtask2_02.txt AC 75 ms 19284 KB
subtask2_03.txt AC 75 ms 19284 KB
subtask2_04.txt AC 80 ms 21076 KB
subtask2_05.txt AC 76 ms 18388 KB
subtask2_06.txt AC 76 ms 18132 KB
subtask2_07.txt AC 77 ms 23124 KB
subtask2_08.txt AC 76 ms 21332 KB
subtask2_09.txt AC 76 ms 21332 KB
subtask2_10.txt AC 76 ms 20052 KB
subtask2_11.txt AC 77 ms 22996 KB
subtask2_12.txt AC 75 ms 19540 KB
subtask2_13.txt AC 76 ms 23124 KB
subtask2_14.txt AC 77 ms 18516 KB
subtask2_15.txt AC 77 ms 18516 KB
subtask2_16.txt AC 75 ms 19924 KB
subtask2_17.txt AC 76 ms 19284 KB
subtask2_18.txt AC 76 ms 21076 KB
subtask2_19.txt AC 76 ms 18644 KB
subtask2_20.txt AC 76 ms 19284 KB