Submission #169209


Source Code Expand

Copy
#include<iostream>
#include<iomanip>
#include<cstdio>
#include<vector>
#include<algorithm>
#include<functional>
#include<string>
#include<cstdlib>
#include<cmath>
#include<map>
#include<set>
#include<list>
#include<utility>
#include<cstring>
#include<queue>
#include<stack>
#include<climits>
using namespace std;

#define rrepp(i, from, to) for (int i = (from); i <= (to); ++i)
#define rrep(i, from, to) for (int i = (from); i < (to); ++i)
#define repp(i, from, to) for (i = (from); i <= (to); ++i)
#define rep(i, from, to) for (i = (from); i < (to); ++i)



int main()
{
	int n;
	cin >> n;
	vector<int> c(n);
	rrep (i, 0, n) {
		cin >> c[i];
	}
	double result = 0;
	rrep(i, 0, n) {
		int cnt = 0;
		rrep(j, 0, n) {
			if (i != j && c[i] % c[j] == 0) {
				++cnt;
			}
		}
		result += (cnt / 2 + 1) / double(cnt + 1);
	}
	printf("%.9f\n", result);
	return 0;
}

Submission Info

Submission Time
Task C - コイン
User yasuand
Language C++ (G++ 4.6.4)
Score 100
Code Size 906 Byte
Status AC
Exec Time 26 ms
Memory 968 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 23 ms 912 KB
sample_02.txt AC 26 ms 872 KB
sample_03.txt AC 22 ms 920 KB
subtask1_01.txt AC 22 ms 912 KB
subtask1_02.txt AC 23 ms 968 KB
subtask1_03.txt AC 22 ms 916 KB
subtask1_04.txt AC 22 ms 916 KB
subtask1_05.txt AC 24 ms 868 KB
subtask1_06.txt AC 24 ms 916 KB
subtask1_07.txt AC 25 ms 916 KB
subtask1_08.txt AC 22 ms 928 KB
subtask1_09.txt AC 23 ms 920 KB
subtask1_10.txt AC 25 ms 912 KB
subtask1_11.txt AC 21 ms 816 KB
subtask1_12.txt AC 21 ms 904 KB
subtask1_13.txt AC 24 ms 820 KB
subtask1_14.txt AC 22 ms 912 KB
subtask1_15.txt AC 22 ms 836 KB
subtask1_16.txt AC 22 ms 916 KB
subtask1_17.txt AC 22 ms 916 KB
subtask1_18.txt AC 24 ms 916 KB
subtask1_19.txt AC 21 ms 916 KB
subtask1_20.txt AC 23 ms 820 KB
subtask2_01.txt AC 21 ms 912 KB
subtask2_02.txt AC 22 ms 920 KB
subtask2_03.txt AC 23 ms 956 KB
subtask2_04.txt AC 23 ms 912 KB
subtask2_05.txt AC 22 ms 840 KB
subtask2_06.txt AC 23 ms 916 KB
subtask2_07.txt AC 22 ms 904 KB
subtask2_08.txt AC 23 ms 916 KB
subtask2_09.txt AC 22 ms 920 KB
subtask2_10.txt AC 22 ms 920 KB
subtask2_11.txt AC 24 ms 920 KB
subtask2_12.txt AC 23 ms 964 KB
subtask2_13.txt AC 22 ms 908 KB
subtask2_14.txt AC 23 ms 912 KB
subtask2_15.txt AC 21 ms 916 KB
subtask2_16.txt AC 24 ms 920 KB
subtask2_17.txt AC 25 ms 916 KB
subtask2_18.txt AC 24 ms 916 KB
subtask2_19.txt AC 22 ms 920 KB
subtask2_20.txt AC 23 ms 944 KB