Submission #1519758


Source Code Expand

import std.array;
import std.stdio;
import std.range;
import std.algorithm;
import std.format;
import std.bigint;
import std.functional;
import std.string;
import std.conv;

void main()
{
	long N = readln.chomp.to!long();
	long[] C = iota(N).map!(_ => readln.chomp.to!long).array();
	format("%.9f", solve(C)).writeln();
}

double solve(long[] C)
{
	double p = iota(1, C.length + 1).reduce!((a, b) => a * b).to!double;
	long[] divisor = new long[](C.length);
	divisor[] = 0;
	double result = 0;
	C.sort();
	foreach (i, c; C)
	{
		foreach (j, d; C[i .. $])
			if (d % c == 0)
			{
				divisor[i + j]++;
			}
	}
	foreach (i, c; C)
	{
		if (divisor[i] % 2 == 0)
		{
			result += 1.0 / 2;
		}
		else
		{
			result += cast(double)(divisor[i] + 1) / (2 * divisor[i]);
		}

	}
	return result;
}

Submission Info

Submission Time
Task C - コイン
User kotet
Language D (DMD64 v2.070.1)
Score 0
Code Size 833 Byte
Status WA
Exec Time 1 ms
Memory 256 KB

Judge Result

Set Name Sample Subtask1 Subtask2
Score / Max Score 0 / 0 0 / 99 0 / 1
Status
AC × 1
WA × 2
AC × 15
WA × 5
AC × 22
WA × 18
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 1 ms 256 KB
sample_02.txt WA 1 ms 256 KB
sample_03.txt WA 1 ms 256 KB
subtask1_01.txt AC 1 ms 256 KB
subtask1_02.txt AC 1 ms 256 KB
subtask1_03.txt AC 1 ms 256 KB
subtask1_04.txt AC 1 ms 256 KB
subtask1_05.txt AC 1 ms 256 KB
subtask1_06.txt AC 1 ms 256 KB
subtask1_07.txt AC 1 ms 256 KB
subtask1_08.txt WA 1 ms 256 KB
subtask1_09.txt AC 1 ms 256 KB
subtask1_10.txt AC 1 ms 256 KB
subtask1_11.txt AC 1 ms 256 KB
subtask1_12.txt AC 1 ms 256 KB
subtask1_13.txt WA 1 ms 256 KB
subtask1_14.txt WA 1 ms 256 KB
subtask1_15.txt WA 1 ms 256 KB
subtask1_16.txt AC 1 ms 256 KB
subtask1_17.txt AC 1 ms 256 KB
subtask1_18.txt WA 1 ms 256 KB
subtask1_19.txt AC 1 ms 256 KB
subtask1_20.txt AC 1 ms 256 KB
subtask2_01.txt AC 1 ms 256 KB
subtask2_02.txt WA 1 ms 256 KB
subtask2_03.txt WA 1 ms 256 KB
subtask2_04.txt WA 1 ms 256 KB
subtask2_05.txt AC 1 ms 256 KB
subtask2_06.txt AC 1 ms 256 KB
subtask2_07.txt AC 1 ms 256 KB
subtask2_08.txt WA 1 ms 256 KB
subtask2_09.txt WA 1 ms 256 KB
subtask2_10.txt WA 1 ms 256 KB
subtask2_11.txt WA 1 ms 256 KB
subtask2_12.txt WA 1 ms 256 KB
subtask2_13.txt WA 1 ms 256 KB
subtask2_14.txt WA 1 ms 256 KB
subtask2_15.txt WA 1 ms 256 KB
subtask2_16.txt AC 1 ms 256 KB
subtask2_17.txt WA 1 ms 256 KB
subtask2_18.txt AC 1 ms 256 KB
subtask2_19.txt AC 1 ms 256 KB
subtask2_20.txt WA 1 ms 256 KB