Submission #1759003


Source Code Expand

#include<cstdio>

using namespace std;

int main(){
	int n, c[100], d[100] = {};
	scanf("%d", &n);
	for(int i = 0; i < n; i++) scanf("%d", &c[i]);
	for(int i = 0; i < n; i++) for(int j = 0; j < n; j++)
		if(i != j && c[i] % c[j] == 0) d[i]++;
	double r = 0;
	for(int i = 0; i < n; i++){
		if(d[i] % 2 == 0) r += (double)(d[i] + 2) / (2 * d[i] + 2);
		else r += 0.5;
	}
	printf("%f\n", r);
	return 0;
}

Submission Info

Submission Time
Task C - コイン
User orpheus
Language C++14 (GCC 5.4.1)
Score 100
Code Size 418 Byte
Status AC
Exec Time 3 ms
Memory 128 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:7:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &n);
                 ^
./Main.cpp:8:47: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  for(int i = 0; i < n; i++) scanf("%d", &c[i]);
                                               ^

Judge Result

Set Name Sample Subtask1 Subtask2
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
Subtask1 subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask1_20.txt
Subtask2 subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask1_20.txt, subtask2_01.txt, subtask2_02.txt, subtask2_03.txt, subtask2_04.txt, subtask2_05.txt, subtask2_06.txt, subtask2_07.txt, subtask2_08.txt, subtask2_09.txt, subtask2_10.txt, subtask2_11.txt, subtask2_12.txt, subtask2_13.txt, subtask2_14.txt, subtask2_15.txt, subtask2_16.txt, subtask2_17.txt, subtask2_18.txt, subtask2_19.txt, subtask2_20.txt
Case Name Status Exec Time Memory
sample_01.txt AC 1 ms 128 KB
sample_02.txt AC 1 ms 128 KB
sample_03.txt AC 0 ms 128 KB
subtask1_01.txt AC 0 ms 128 KB
subtask1_02.txt AC 1 ms 128 KB
subtask1_03.txt AC 0 ms 128 KB
subtask1_04.txt AC 0 ms 128 KB
subtask1_05.txt AC 0 ms 128 KB
subtask1_06.txt AC 0 ms 128 KB
subtask1_07.txt AC 3 ms 128 KB
subtask1_08.txt AC 0 ms 128 KB
subtask1_09.txt AC 0 ms 128 KB
subtask1_10.txt AC 1 ms 128 KB
subtask1_11.txt AC 0 ms 128 KB
subtask1_12.txt AC 0 ms 128 KB
subtask1_13.txt AC 0 ms 128 KB
subtask1_14.txt AC 0 ms 128 KB
subtask1_15.txt AC 0 ms 128 KB
subtask1_16.txt AC 0 ms 128 KB
subtask1_17.txt AC 0 ms 128 KB
subtask1_18.txt AC 0 ms 128 KB
subtask1_19.txt AC 0 ms 128 KB
subtask1_20.txt AC 0 ms 128 KB
subtask2_01.txt AC 0 ms 128 KB
subtask2_02.txt AC 0 ms 128 KB
subtask2_03.txt AC 0 ms 128 KB
subtask2_04.txt AC 1 ms 128 KB
subtask2_05.txt AC 1 ms 128 KB
subtask2_06.txt AC 1 ms 128 KB
subtask2_07.txt AC 1 ms 128 KB
subtask2_08.txt AC 1 ms 128 KB
subtask2_09.txt AC 1 ms 128 KB
subtask2_10.txt AC 1 ms 128 KB
subtask2_11.txt AC 1 ms 128 KB
subtask2_12.txt AC 1 ms 128 KB
subtask2_13.txt AC 1 ms 128 KB
subtask2_14.txt AC 1 ms 128 KB
subtask2_15.txt AC 1 ms 128 KB
subtask2_16.txt AC 1 ms 128 KB
subtask2_17.txt AC 1 ms 128 KB
subtask2_18.txt AC 0 ms 128 KB
subtask2_19.txt AC 1 ms 128 KB
subtask2_20.txt AC 1 ms 128 KB