Submission #2179738

---

Source Code Expand

#include<vector>
#include<iostream>
#include<string>
#include<algorithm>
#include<math.h>
#include<map>
#include<functional>
#include<queue>
#include<stack>
#include<string.h>
#include<list>
#include<limits>
#include<bitset>
#include<ctype.h>
#include<set>
using namespace std;
typedef long long int ll;
const ll MOD=10007;
const ll INF=1000000000;
const int MAX=100001;
const double EPS=1e-10;
int main(){
    int n;
    cin>>n;
    int c[101];
    for(int i=0;i<n;i++){
        cin>>c[i];
    }
    int y[101]={};
    for(int i=0;i<n;i++){
        for(int j=0;j<n;j++){
            if(i!=j&&c[i]%c[j]==0){
                y[i]++;
            }
        }
    }
    double ans=0.0;
    for(int i=0;i<n;i++){
        int s=y[i];
        if(s%2==1){
            ans+=0.5;
        }else{
            ans+=(double)(s+2)/(double)(2*s+2);
        }
    }
    printf("%.10lf\n",ans);
    return 0;
}

                           

Submission Info

Judge Result