Submission #1706931

---

Source Code Expand

#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <queue>
#include <stack>
#include <math.h>
#include <iomanip>
using namespace std;

void a()
{
    int s, t;
    cin >> s >> t;
    cout << (t - s + 1) << endl;
    return;
}

void b()
{
    int n;
    cin >> n;
    map<string, int> vote;
    for(int i = 0; i < n; i++)
    {
        string name;
        cin >> name;
        if(vote.count(name))
        {
            vote[name]++;
        }else{
            vote[name] = 1;
        }
    }
    int maxvote = 0;
    string result;
    for(auto e : vote)
    {
        if(e.second >= maxvote)
        {
            maxvote = e.second;
            result = e.first;
        }
    }
    cout << result << endl;
    return;
}

void c()
{
    int n;
    cin >> n;
    vector<int> c(n);
    for(int i = 0; i < n; i++)
    {
        cin >> c[i];
    }
    double ans = 0.0;
    for(int i = 0; i < n; i++)
    {
        int s = 0;
        for(int j = 0; j < n; j++)
        {
            if(i != j)
            {
                if(c[i] % c[j] == 0) s++;
            }
        }
        if(s % 2 == 0)
        {
            ans += (ceil(0.5 * (s+1)) / (s + 1));
        }else{
            ans += 0.5;
        }
    }
    cout << fixed;
    cout << setprecision(7) <<ans << endl;
}

int main() {
    c();
    return 0;
}

Submission Info

Judge Result