Submission #169356

---

Source Code Expand

#include<iostream>
#include<cstdio>
#include<string>
#include<vector>
#include<algorithm>
#include<cstdlib>
using namespace std;
typedef long long int ll;

int main()
{
    int n;
    double d[100];
	int c[100];
	cin >> n;
	for(int i=0;i<n;i++){
		cin >> d[i];
		c[i]=d[i];
	}
	sort(c,c+n);
	double ans[100];
	for(int i=0;i<n;i++){
		double gc=-1;
		for(int j=0;j<n;j++){
			if(c[i]%c[j]==0)gc++;
		}
		int gd=gc;
	    ans[i]=0.5;
		if(gd%2==0)ans[i]+=1/(2*(gc+1));
	}
	double cou=0;
	for(int i=0;i<n;i++){
		cou+=ans[i];
	}
	cout << cou << "\n";
    return 0;
}

Submission Info

Judge Result