(cache)Submission #76715356 - AtCoder Beginner Contest 456

Contest Duration: 2026-05-02(Sat) 21:00 - 2026-05-02(Sat) 22:40 (local time) (100 minutes) Back to Home

Submission #76715356

Source Code Expand

Copy

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
#include <stdio.h>
int main(void) {
  int A[3][6];
  int i, j, k;
  int cnt = 0;
  for (i = 0; i < 3; i++) {
    for (j = 0; j < 6; j++) {
      if (scanf("%d", &A[i][j]) != 1) return 1;
    }
  }
  for (i = 0; i < 6; i++) {
    for (j = 0; j < 6; j++) {
      for (k = 0; k < 6; k++) {
        int r = 0;
        r |= 1 << A[0][i];
        r |= 1 << A[1][j];
        r |= 1 << A[2][k];
        cnt += r == ((1 << 4) | (1 << 5) | (1 << 6));
      }
    }
  }
  printf("%.30f\n", cnt / (6.0 * 6.0 * 6.0));
  return 0;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#include <stdio.h>

int main(void) {
	int A[3][6];
	int i, j, k;
	int cnt = 0;
	for (i = 0; i < 3; i++) {
		for (j = 0; j < 6; j++) {
			if (scanf("%d", &A[i][j]) != 1) return 1;
		}
	}
	for (i = 0; i < 6; i++) {
		for (j = 0; j < 6; j++) {
			for (k = 0; k < 6; k++) {
				int r = 0;
				r |= 1 << A[0][i];
				r |= 1 << A[1][j];
				r |= 1 << A[2][k];
				cnt += r == ((1 << 4) | (1 << 5) | (1 << 6));
			}
		}
	}
	printf("%.30f\n", cnt / (6.0 * 6.0 * 6.0));
	return 0;
}

Submission Info

Submission Time	2026-06-16 00:27:31
Task	B - 456
User	mikecat
Language	C23 (GCC 14.2.0)
Score	200
Code Size	499 Byte
Status	AC
Exec Time	0 ms
Memory	1672 KiB

Judge Result

Set Name

Sample

All

Score / Max Score

0 / 0

200 / 200

Status

× 2

× 14

Set Name	Test Cases
Sample	sample_01.txt, sample_02.txt
All	random_01.txt, random_02.txt, random_03.txt, random_04.txt, random_05.txt, random_06.txt, random_07.txt, random_08.txt, random_09.txt, random_10.txt, random_11.txt, random_12.txt, sample_01.txt, sample_02.txt

Case Name	Status	Memory
random_01.txt	AC	1644 KiB
random_02.txt	AC	1624 KiB
random_03.txt	AC	1636 KiB
random_04.txt	AC	1636 KiB
random_05.txt	AC	1644 KiB
random_06.txt	AC	1620 KiB
random_07.txt	AC	1672 KiB
random_08.txt	AC	1624 KiB
random_09.txt	AC	1636 KiB
random_10.txt	AC	1628 KiB
random_11.txt	AC	1664 KiB
random_12.txt	AC	1608 KiB
sample_01.txt	AC	1624 KiB
sample_02.txt	AC	1624 KiB