Submission #2856040


Source Code Expand

#include <stdio.h>
#include <stdlib.h>
#include <stdint.h>
#include <stdbool.h>
#include <limits.h>
#include <cinttypes>

#define max(a,b) (((a) > (b)) ? (a) : (b))
#define min(a,b) (((a) < (b)) ? (a) : (b))
#define abs(a) (((a) < 0) ? -(a) : (a))

#define FOR(var, to)          for (register int var = 0; var < to; var++)
#define FROMTO(var, from, to) for (register int var = from; var <= to; var++)

typedef uint8_t u8;
typedef uint16_t u16;
typedef uint32_t u32;
typedef uint64_t u64;
typedef int8_t s8;
typedef int16_t s16;
typedef int32_t s32;
typedef int64_t s64;

static inline int ri() {
	int a;
	scanf("%d", &a);
	return a;
}

static inline s64 rs64() {
	s64 a;
	scanf("%" SCNd64, &a);
	return a;
}

static inline void wi(int a) {
	printf("%d", a);
}

static inline void wu64(u64 a) {
	printf("%" PRIu64, a);
}

int n;
int c[8];

int search(int depth, bool used[8], int array[8]) {
	if (depth == n) {
		bool o[8] = {true,true,true,true,
								true,true,true,true};
		FOR(i,n) {
			FROMTO(j,i+1,n-1) {
				if(!(array[j]%array[i])) o[j] = !o[j];
			}
		}
		int res = 0;
		FOR(i,n) if (o[i]) res++;
		return res;
	}
	
	int res = 0;
	FOR(i,n) {
		if (used[i]) continue;
		bool used_[8];
		FOR(j,n) used_[j] = used[j];
		used_[i] = true;
		
		int array_[8];
		FOR(j,n) array_[j] = array[j];
		array_[depth] = c[i];
		res += search(depth+1,used_,array_);
	}
	return res;
}

int main() {
	n = ri();
	FOR(i,n)c[i] = ri();
	
	bool a[8] = {false};
	int b[8];
	int res = search(0,a,b);
	
	int kai =1;
	FROMTO(i,2,n)kai*=i;
	printf("%.7f\n", res/(double)kai);
	
	return 0;
}

Submission Info

Submission Time
Task C - コイン
User QCFium
Language C++14 (GCC 5.4.1)
Score 99
Code Size 1663 Byte
Status RE
Exec Time 99 ms
Memory 128 KB

Compile Error

./Main.cpp: In function ‘int ri()’:
./Main.cpp:26:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &a);
                 ^

Judge Result

Set Name Sample Subtask1 Subtask2
Score / Max Score 0 / 0 99 / 99 0 / 1
Status
AC × 3
AC × 20
AC × 20
WA × 5
RE × 15
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 1 ms 128 KB
subtask1_01.txt AC 0 ms 128 KB
subtask1_02.txt AC 1 ms 128 KB
subtask1_03.txt AC 1 ms 128 KB
subtask1_04.txt AC 9 ms 128 KB
subtask1_05.txt AC 10 ms 128 KB
subtask1_06.txt AC 2 ms 128 KB
subtask1_07.txt AC 8 ms 128 KB
subtask1_08.txt AC 1 ms 128 KB
subtask1_09.txt AC 1 ms 128 KB
subtask1_10.txt AC 10 ms 128 KB
subtask1_11.txt AC 1 ms 128 KB
subtask1_12.txt AC 8 ms 128 KB
subtask1_13.txt AC 1 ms 128 KB
subtask1_14.txt AC 1 ms 128 KB
subtask1_15.txt AC 11 ms 128 KB
subtask1_16.txt AC 8 ms 128 KB
subtask1_17.txt AC 11 ms 128 KB
subtask1_18.txt AC 10 ms 128 KB
subtask1_19.txt AC 10 ms 128 KB
subtask1_20.txt AC 10 ms 128 KB
subtask2_01.txt WA 1 ms 128 KB
subtask2_02.txt WA 0 ms 128 KB
subtask2_03.txt RE 99 ms 128 KB
subtask2_04.txt RE 97 ms 128 KB
subtask2_05.txt WA 4 ms 128 KB
subtask2_06.txt RE 97 ms 128 KB
subtask2_07.txt RE 98 ms 128 KB
subtask2_08.txt RE 97 ms 128 KB
subtask2_09.txt WA 1 ms 128 KB
subtask2_10.txt RE 97 ms 128 KB
subtask2_11.txt RE 96 ms 128 KB
subtask2_12.txt RE 97 ms 128 KB
subtask2_13.txt RE 97 ms 128 KB
subtask2_14.txt RE 97 ms 128 KB
subtask2_15.txt RE 96 ms 128 KB
subtask2_16.txt RE 97 ms 128 KB
subtask2_17.txt WA 1 ms 128 KB
subtask2_18.txt RE 96 ms 128 KB
subtask2_19.txt RE 96 ms 128 KB
subtask2_20.txt RE 96 ms 128 KB