Contest Duration: - (local time) (120 minutes) Back to Home

Submission #417228

Source Code Expand

Copy
```#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cassert>
#include <functional>
#include <iostream>
#include <iomanip>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <utility>
#include <vector>

using namespace std;

typedef long double real;
typedef long long Long;
#define whole(xs) xs.begin(), xs.end()
#define uniq(xs) (xs.erase(unique(xs.begin(), xs.end()), xs.end()))

template<class T>
ostream& operator<<(ostream& os, const vector<T>& vs) {
if (vs.empty()) return os << "[]";
os << "[" << vs[0];
for (int i = 1; i < vs.size(); i++) os << " " << vs[i];
return os << "]";
}

const int IINF = 1<<28;
const Long LINF = 1LL<<56;
#define INF IINF

const int MAX_N = 101;

int N;
vector<int> C;
void Input() {
cin >> N;
C.clear(); C.resize(N);
for (int i = 0; i < N; i++) cin >> C[i];
}

void Solve() {
real Ans = 0;
for (int i = 0; i < N; i++) {
int x = 0;
for (int j = 0; j < N; j++) {
if (C[i] % C[j] == 0) x++;
}
Ans += (x + 1) / 2 * (1.0 / x);
}
printf("%.10Lf\n", Ans);
}

int main() {
Input(); Solve();
return 0;
}
```

#### Submission Info

Submission Time 2015-05-27 18:58:25+0900 C - コイン izuru C++ (G++ 4.6.4) 100 1303 Byte AC 29 ms 964 KB

#### Judge Result

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
Case Name Status Exec Time Memory
sample_01.txt AC 26 ms 924 KB
sample_02.txt AC 25 ms 800 KB
sample_03.txt AC 25 ms 920 KB
subtask1_01.txt AC 25 ms 924 KB
subtask1_02.txt AC 26 ms 924 KB
subtask1_03.txt AC 25 ms 792 KB
subtask1_04.txt AC 24 ms 920 KB
subtask1_05.txt AC 25 ms 796 KB
subtask1_06.txt AC 25 ms 920 KB
subtask1_07.txt AC 25 ms 964 KB
subtask1_08.txt AC 25 ms 796 KB
subtask1_09.txt AC 26 ms 916 KB
subtask1_10.txt AC 25 ms 876 KB
subtask1_11.txt AC 25 ms 792 KB
subtask1_12.txt AC 25 ms 920 KB
subtask1_13.txt AC 25 ms 800 KB
subtask1_14.txt AC 23 ms 864 KB
subtask1_15.txt AC 25 ms 800 KB
subtask1_16.txt AC 25 ms 860 KB
subtask1_17.txt AC 26 ms 852 KB
subtask1_18.txt AC 25 ms 796 KB
subtask1_19.txt AC 26 ms 920 KB
subtask1_20.txt AC 26 ms 868 KB
subtask2_01.txt AC 26 ms 860 KB
subtask2_02.txt AC 26 ms 920 KB
subtask2_03.txt AC 27 ms 924 KB
subtask2_04.txt AC 27 ms 880 KB
subtask2_05.txt AC 26 ms 920 KB
subtask2_06.txt AC 27 ms 796 KB
subtask2_07.txt AC 29 ms 860 KB
subtask2_08.txt AC 26 ms 872 KB
subtask2_09.txt AC 25 ms 800 KB
subtask2_10.txt AC 25 ms 796 KB
subtask2_11.txt AC 28 ms 872 KB
subtask2_12.txt AC 26 ms 796 KB
subtask2_13.txt AC 25 ms 860 KB
subtask2_14.txt AC 25 ms 920 KB
subtask2_15.txt AC 24 ms 920 KB
subtask2_16.txt AC 25 ms 920 KB
subtask2_17.txt AC 23 ms 796 KB
subtask2_18.txt AC 25 ms 924 KB
subtask2_19.txt AC 25 ms 916 KB
subtask2_20.txt AC 27 ms 920 KB