Submission #175852
Source Code Expand
#include <iostream> #include <algorithm> #include <stdio.h> #include <math.h> using namespace std; int main() { int N; int C[100+10]; cin >> N; for (int i=0;i<N;i++) { cin >> C[i]; } sort(C,C+N); double kitai = 0; for (int i=0;i<N;i++) { double n = 0; for (int j=0;j<N;j++) { if (!(C[i]%C[j])) { n++; } if (C[j] > C[i]) { break; } } kitai += ceil(n/2)/n; } printf("%.7f\n",kitai); /*for (int n=0;n<10;n++) { cout << ceil(((double)n+1)/2)/((double)n+1) << endl; }*/ }
Submission Info
Submission Time | |
---|---|
Task | C - コイン |
User | kazunetakahashi |
Language | C++11 (GCC 4.8.1) |
Score | 100 |
Code Size | 576 Byte |
Status | AC |
Exec Time | 44 ms |
Memory | 920 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 | 44 ms | 864 KB |
sample_02.txt | AC | 27 ms | 820 KB |
sample_03.txt | AC | 25 ms | 920 KB |
subtask1_01.txt | AC | 25 ms | 816 KB |
subtask1_02.txt | AC | 27 ms | 864 KB |
subtask1_03.txt | AC | 28 ms | 860 KB |
subtask1_04.txt | AC | 24 ms | 856 KB |
subtask1_05.txt | AC | 25 ms | 864 KB |
subtask1_06.txt | AC | 24 ms | 816 KB |
subtask1_07.txt | AC | 22 ms | 916 KB |
subtask1_08.txt | AC | 24 ms | 920 KB |
subtask1_09.txt | AC | 22 ms | 916 KB |
subtask1_10.txt | AC | 25 ms | 920 KB |
subtask1_11.txt | AC | 25 ms | 868 KB |
subtask1_12.txt | AC | 25 ms | 864 KB |
subtask1_13.txt | AC | 25 ms | 912 KB |
subtask1_14.txt | AC | 26 ms | 864 KB |
subtask1_15.txt | AC | 26 ms | 916 KB |
subtask1_16.txt | AC | 23 ms | 912 KB |
subtask1_17.txt | AC | 25 ms | 912 KB |
subtask1_18.txt | AC | 24 ms | 868 KB |
subtask1_19.txt | AC | 30 ms | 864 KB |
subtask1_20.txt | AC | 29 ms | 916 KB |
subtask2_01.txt | AC | 27 ms | 856 KB |
subtask2_02.txt | AC | 25 ms | 872 KB |
subtask2_03.txt | AC | 27 ms | 920 KB |
subtask2_04.txt | AC | 26 ms | 876 KB |
subtask2_05.txt | AC | 25 ms | 916 KB |
subtask2_06.txt | AC | 26 ms | 912 KB |
subtask2_07.txt | AC | 23 ms | 908 KB |
subtask2_08.txt | AC | 25 ms | 912 KB |
subtask2_09.txt | AC | 24 ms | 920 KB |
subtask2_10.txt | AC | 24 ms | 912 KB |
subtask2_11.txt | AC | 25 ms | 860 KB |
subtask2_12.txt | AC | 24 ms | 876 KB |
subtask2_13.txt | AC | 24 ms | 912 KB |
subtask2_14.txt | AC | 24 ms | 916 KB |
subtask2_15.txt | AC | 26 ms | 888 KB |
subtask2_16.txt | AC | 26 ms | 896 KB |
subtask2_17.txt | AC | 26 ms | 856 KB |
subtask2_18.txt | AC | 25 ms | 916 KB |
subtask2_19.txt | AC | 24 ms | 920 KB |
subtask2_20.txt | AC | 27 ms | 864 KB |