Submission #1030429
Source Code Expand
#include <bits/stdc++.h> #define REP(i,n) for(int i=0; i<(int)(n); ++i) #define RREP(i,n) for(int i=(int)(n); i>=0; --i) #define FOR(i,k,n) for(int i=(k);i<(int)(n);++i) typedef long long int ll; using namespace std; int main(void) { int N; cin >> N; vector<int> C(N); REP(i, N) cin >> C[i]; double ans = 0; REP(i, N) { int S = 0; REP(j, N) { if(i != j && C[i] % C[j] == 0) S++; } if(S%2 == 1) ans += 0.5; else ans += double(S+2.0)/(2.0*S+2.0); } printf("%.10f\n", ans); }
Submission Info
Submission Time | |
---|---|
Task | C - コイン |
User | kivantium |
Language | C++ (G++ 4.6.4) |
Score | 100 |
Code Size | 582 Byte |
Status | AC |
Exec Time | 19 ms |
Memory | 928 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 | 17 ms | 800 KB |
sample_02.txt | AC | 19 ms | 672 KB |
sample_03.txt | AC | 19 ms | 800 KB |
subtask1_01.txt | AC | 19 ms | 796 KB |
subtask1_02.txt | AC | 19 ms | 800 KB |
subtask1_03.txt | AC | 19 ms | 796 KB |
subtask1_04.txt | AC | 17 ms | 800 KB |
subtask1_05.txt | AC | 18 ms | 800 KB |
subtask1_06.txt | AC | 17 ms | 800 KB |
subtask1_07.txt | AC | 19 ms | 796 KB |
subtask1_08.txt | AC | 18 ms | 800 KB |
subtask1_09.txt | AC | 19 ms | 796 KB |
subtask1_10.txt | AC | 19 ms | 800 KB |
subtask1_11.txt | AC | 18 ms | 928 KB |
subtask1_12.txt | AC | 19 ms | 800 KB |
subtask1_13.txt | AC | 17 ms | 792 KB |
subtask1_14.txt | AC | 17 ms | 800 KB |
subtask1_15.txt | AC | 18 ms | 800 KB |
subtask1_16.txt | AC | 17 ms | 796 KB |
subtask1_17.txt | AC | 19 ms | 800 KB |
subtask1_18.txt | AC | 17 ms | 920 KB |
subtask1_19.txt | AC | 17 ms | 672 KB |
subtask1_20.txt | AC | 19 ms | 672 KB |
subtask2_01.txt | AC | 18 ms | 800 KB |
subtask2_02.txt | AC | 19 ms | 800 KB |
subtask2_03.txt | AC | 17 ms | 796 KB |
subtask2_04.txt | AC | 19 ms | 800 KB |
subtask2_05.txt | AC | 18 ms | 800 KB |
subtask2_06.txt | AC | 17 ms | 800 KB |
subtask2_07.txt | AC | 18 ms | 916 KB |
subtask2_08.txt | AC | 19 ms | 800 KB |
subtask2_09.txt | AC | 18 ms | 796 KB |
subtask2_10.txt | AC | 19 ms | 800 KB |
subtask2_11.txt | AC | 17 ms | 928 KB |
subtask2_12.txt | AC | 19 ms | 712 KB |
subtask2_13.txt | AC | 19 ms | 796 KB |
subtask2_14.txt | AC | 17 ms | 796 KB |
subtask2_15.txt | AC | 19 ms | 928 KB |
subtask2_16.txt | AC | 19 ms | 796 KB |
subtask2_17.txt | AC | 17 ms | 796 KB |
subtask2_18.txt | AC | 19 ms | 800 KB |
subtask2_19.txt | AC | 17 ms | 792 KB |
subtask2_20.txt | AC | 18 ms | 672 KB |