Submission #1673716


Source Code Expand

#include <bits/stdc++.h>
using namespace std;

#define REP(i,n) for(int i=0;i<n;i++)
#define REPR(i,n) for(int i=n;i>=0;i--)
#define FOR(i,m,n) for(int i=m;i<n;i++)
#define EPS (1e-7)
#define MAX_N 100

typedef long long ll;

typedef pair<int,int>P;

int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};

int main(){	
	int n;
	cin>>n;
	vector<int> c(n);
	REP(i,n){
		cin>>c[i];
	}
	int a[n];//約数の個数
	fill(a,a+n,0);
	REP(i,n){
		REP(j,n){
			if(i!=j && c[i]>=c[j] && c[i]%c[j]==0){
				a[i]++;
			}
		}
	}
	double ans=0;
	REP(i,n){
		if(a[i]%2==0){
			ans+=(double)(a[i]+2)/(2*(a[i]+1));
		}else{
			ans+=0.5;
		}
	}
	printf("%.10f\n",ans);
	return 0;
}

Submission Info

Submission Time
Task A - アルバム
User kwkm0429
Language C++14 (GCC 5.4.1)
Score 0
Code Size 695 Byte
Status RE
Exec Time 112 ms
Memory 256 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 100
Status
WA × 1
RE × 1
WA × 2
RE × 15
Set Name Test Cases
Sample sample_01.txt, sample_02.txt
All sample_01.txt, sample_02.txt, case_01.txt, case_02.txt, case_03.txt, case_04.txt, case_05.txt, case_06.txt, case_07.txt, case_08.txt, case_09.txt, case_10.txt, case_11.txt, case_12.txt, case_13.txt, case_14.txt, case_15.txt
Case Name Status Exec Time Memory
case_01.txt RE 112 ms 256 KB
case_02.txt RE 99 ms 256 KB
case_03.txt RE 99 ms 256 KB
case_04.txt RE 100 ms 256 KB
case_05.txt RE 102 ms 256 KB
case_06.txt RE 101 ms 256 KB
case_07.txt RE 98 ms 256 KB
case_08.txt RE 97 ms 256 KB
case_09.txt WA 1 ms 256 KB
case_10.txt RE 97 ms 256 KB
case_11.txt RE 98 ms 256 KB
case_12.txt RE 98 ms 256 KB
case_13.txt RE 97 ms 256 KB
case_14.txt RE 98 ms 256 KB
case_15.txt RE 98 ms 256 KB
sample_01.txt RE 98 ms 256 KB
sample_02.txt WA 1 ms 256 KB