Submission #170080


Source Code Expand

Copy
#include <iostream>
#include <vector>
#include <algorithm>
#include <numeric>
#include <set>
#include <map>
#include <string>
#include <stack>
#include <queue>
#include <cmath>
#include <cstdio>
#include <istream>
#include <sstream>
#include <iomanip>
#include <iterator>
#include <climits>
#include <iomanip>
using namespace std;

typedef ostringstream OSS;
typedef istringstream ISS;

typedef vector<int> VI;
typedef vector< VI > VVI;

typedef long long LL;

typedef pair<int, int> PII;
typedef vector<PII> VPII;

#define X first
#define Y second

int main(void) {
	int N;
	cin >> N;
	VI coins(N);
	for(auto &coin : coins) {
		cin >> coin;
	}

	double p = 0;
	for (int i = 0; i < N; i++) {
		int divisor = count_if(coins.begin(), coins.end(), [&](int div){ return !(coins[i] % div); }) - 1;
		if (divisor) {
			p += divisor % 2 ? .5 : (divisor + 2) / (2 * divisor + 2.0);
		}else {
			p += 1;
		}
	}

	cout << fixed << setprecision(9) << p << endl;

	return 0;
}

Submission Info

Submission Time
Task C - コイン
User snakazawa
Language C++11 (GCC 4.8.1)
Score 100
Code Size 1020 Byte
Status AC
Exec Time 44 ms
Memory 1020 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 44 ms 864 KB
sample_02.txt AC 25 ms 920 KB
sample_03.txt AC 23 ms 936 KB
subtask1_01.txt AC 25 ms 812 KB
subtask1_02.txt AC 24 ms 816 KB
subtask1_03.txt AC 27 ms 936 KB
subtask1_04.txt AC 24 ms 956 KB
subtask1_05.txt AC 24 ms 908 KB
subtask1_06.txt AC 28 ms 916 KB
subtask1_07.txt AC 27 ms 868 KB
subtask1_08.txt AC 24 ms 912 KB
subtask1_09.txt AC 28 ms 864 KB
subtask1_10.txt AC 26 ms 876 KB
subtask1_11.txt AC 24 ms 904 KB
subtask1_12.txt AC 23 ms 908 KB
subtask1_13.txt AC 23 ms 916 KB
subtask1_14.txt AC 27 ms 876 KB
subtask1_15.txt AC 23 ms 912 KB
subtask1_16.txt AC 23 ms 920 KB
subtask1_17.txt AC 24 ms 912 KB
subtask1_18.txt AC 24 ms 912 KB
subtask1_19.txt AC 24 ms 924 KB
subtask1_20.txt AC 24 ms 820 KB
subtask2_01.txt AC 24 ms 816 KB
subtask2_02.txt AC 24 ms 820 KB
subtask2_03.txt AC 23 ms 920 KB
subtask2_04.txt AC 25 ms 1020 KB
subtask2_05.txt AC 24 ms 916 KB
subtask2_06.txt AC 24 ms 908 KB
subtask2_07.txt AC 24 ms 820 KB
subtask2_08.txt AC 25 ms 916 KB
subtask2_09.txt AC 24 ms 916 KB
subtask2_10.txt AC 24 ms 820 KB
subtask2_11.txt AC 24 ms 820 KB
subtask2_12.txt AC 25 ms 912 KB
subtask2_13.txt AC 25 ms 816 KB
subtask2_14.txt AC 24 ms 932 KB
subtask2_15.txt AC 24 ms 920 KB
subtask2_16.txt AC 25 ms 912 KB
subtask2_17.txt AC 24 ms 916 KB
subtask2_18.txt AC 25 ms 808 KB
subtask2_19.txt AC 25 ms 920 KB
subtask2_20.txt AC 25 ms 920 KB