Submission #169920


Source Code Expand

Copy
#include <iostream>
#include <iomanip>
#include <iterator>
#include <algorithm>
#include <functional>
#include <bitset>
#include <string>
#include <list>
#include <vector>
#include <set>
#include <map>
#include <stack>
#include <queue>

typedef unsigned long long int ulli;

int N;
std::vector<ulli> C;
std::vector<ulli> S;

bool is_even(int n) {return ((n & 1) == 0);}

int main(void) {
	std::cin >> N;
	
	C = std::vector<ulli>(N);
	for(int n=0; n<N; ++n) std::cin >> C[n];
	
	S = std::vector<ulli>(N);
	std::fill(S.begin(), S.end(), 0);
	
	for(int n=0; n<N; ++n) {
		for(int m=0; m<N; ++m) {
			if(n == m) continue;
			if((C[n] >= C[m]) && (C[n] % C[m] == 0)) ++S[n];
		}
	}
	
	double p = 0.0;
	for(int s : S) {
		if( is_even(s) ) {
			p += static_cast<double>(s+2) / static_cast<double>(2*(s+1));
		}
		else {
			p += 0.5;
		}
	}
	
	std::cout << std::fixed << std::setprecision(12) << p << std::endl;
	
	return 0;
}

Submission Info

Submission Time
Task C - コイン
User material
Language C++11 (GCC 4.8.1)
Score 100
Code Size 971 Byte
Status AC
Exec Time 41 ms
Memory 924 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 41 ms 812 KB
sample_02.txt AC 22 ms 920 KB
sample_03.txt AC 21 ms 868 KB
subtask1_01.txt AC 22 ms 924 KB
subtask1_02.txt AC 23 ms 816 KB
subtask1_03.txt AC 22 ms 924 KB
subtask1_04.txt AC 23 ms 888 KB
subtask1_05.txt AC 22 ms 808 KB
subtask1_06.txt AC 24 ms 868 KB
subtask1_07.txt AC 21 ms 804 KB
subtask1_08.txt AC 23 ms 924 KB
subtask1_09.txt AC 21 ms 872 KB
subtask1_10.txt AC 22 ms 920 KB
subtask1_11.txt AC 22 ms 812 KB
subtask1_12.txt AC 22 ms 920 KB
subtask1_13.txt AC 21 ms 924 KB
subtask1_14.txt AC 21 ms 924 KB
subtask1_15.txt AC 22 ms 920 KB
subtask1_16.txt AC 23 ms 860 KB
subtask1_17.txt AC 22 ms 920 KB
subtask1_18.txt AC 21 ms 924 KB
subtask1_19.txt AC 21 ms 924 KB
subtask1_20.txt AC 21 ms 924 KB
subtask2_01.txt AC 21 ms 872 KB
subtask2_02.txt AC 22 ms 920 KB
subtask2_03.txt AC 21 ms 924 KB
subtask2_04.txt AC 22 ms 924 KB
subtask2_05.txt AC 23 ms 884 KB
subtask2_06.txt AC 24 ms 800 KB
subtask2_07.txt AC 24 ms 876 KB
subtask2_08.txt AC 22 ms 920 KB
subtask2_09.txt AC 22 ms 872 KB
subtask2_10.txt AC 22 ms 872 KB
subtask2_11.txt AC 21 ms 912 KB
subtask2_12.txt AC 23 ms 924 KB
subtask2_13.txt AC 22 ms 924 KB
subtask2_14.txt AC 22 ms 816 KB
subtask2_15.txt AC 22 ms 920 KB
subtask2_16.txt AC 22 ms 920 KB
subtask2_17.txt AC 21 ms 808 KB
subtask2_18.txt AC 22 ms 808 KB
subtask2_19.txt AC 23 ms 800 KB
subtask2_20.txt AC 21 ms 920 KB