Submission #228139
Source Code Expand
#include <iostream> #include <vector> #include <algorithm> #include<iomanip> using namespace std; int main(){ int N; cin >> N; vector<int> data(N); for(int i=0; i < N; ++i){ cin >> data[i]; } double sum = 0.0; for(int i = 0;i < N;i++){ int count = 0; for(int j = 0;j < N;j++){ if(!(data[i] % data[j])) count++; } count--; sum += ((double)(count / 2 + 1)) / ((double)count + 1.0); } cout <<fixed << setprecision(12) << sum << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - コイン |
User | doi_ken |
Language | C++ (G++ 4.6.4) |
Score | 100 |
Code Size | 533 Byte |
Status | AC |
Exec Time | 50 ms |
Memory | 1668 KB |
Judge Result
Set Name | Sample | Subtask1 | Subtask2 | ||||||
---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 99 / 99 | 1 / 1 | ||||||
Status |
|
|
|
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 | 50 ms | 1660 KB |
sample_02.txt | AC | 38 ms | 1656 KB |
sample_03.txt | AC | 38 ms | 1660 KB |
subtask1_01.txt | AC | 37 ms | 1664 KB |
subtask1_02.txt | AC | 37 ms | 1656 KB |
subtask1_03.txt | AC | 39 ms | 1664 KB |
subtask1_04.txt | AC | 37 ms | 1652 KB |
subtask1_05.txt | AC | 38 ms | 1660 KB |
subtask1_06.txt | AC | 37 ms | 1664 KB |
subtask1_07.txt | AC | 38 ms | 1660 KB |
subtask1_08.txt | AC | 38 ms | 1660 KB |
subtask1_09.txt | AC | 38 ms | 1656 KB |
subtask1_10.txt | AC | 37 ms | 1660 KB |
subtask1_11.txt | AC | 39 ms | 1660 KB |
subtask1_12.txt | AC | 37 ms | 1660 KB |
subtask1_13.txt | AC | 37 ms | 1656 KB |
subtask1_14.txt | AC | 38 ms | 1664 KB |
subtask1_15.txt | AC | 41 ms | 1660 KB |
subtask1_16.txt | AC | 38 ms | 1656 KB |
subtask1_17.txt | AC | 37 ms | 1656 KB |
subtask1_18.txt | AC | 39 ms | 1652 KB |
subtask1_19.txt | AC | 38 ms | 1664 KB |
subtask1_20.txt | AC | 37 ms | 1656 KB |
subtask2_01.txt | AC | 38 ms | 1660 KB |
subtask2_02.txt | AC | 37 ms | 1664 KB |
subtask2_03.txt | AC | 39 ms | 1652 KB |
subtask2_04.txt | AC | 38 ms | 1660 KB |
subtask2_05.txt | AC | 37 ms | 1668 KB |
subtask2_06.txt | AC | 42 ms | 1656 KB |
subtask2_07.txt | AC | 38 ms | 1660 KB |
subtask2_08.txt | AC | 38 ms | 1656 KB |
subtask2_09.txt | AC | 38 ms | 1660 KB |
subtask2_10.txt | AC | 37 ms | 1656 KB |
subtask2_11.txt | AC | 37 ms | 1660 KB |
subtask2_12.txt | AC | 38 ms | 1660 KB |
subtask2_13.txt | AC | 37 ms | 1656 KB |
subtask2_14.txt | AC | 38 ms | 1656 KB |
subtask2_15.txt | AC | 37 ms | 1660 KB |
subtask2_16.txt | AC | 38 ms | 1652 KB |
subtask2_17.txt | AC | 37 ms | 1660 KB |
subtask2_18.txt | AC | 38 ms | 1660 KB |
subtask2_19.txt | AC | 38 ms | 1660 KB |
subtask2_20.txt | AC | 39 ms | 1656 KB |