(cache)Submission #73827872 - AtCoder Beginner Contest 435

Contest Duration: 2025-12-06(Sat) 21:00 - 2025-12-06(Sat) 22:40 (local time) (100 minutes) Back to Home

Submission #73827872

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
#include <stdio.h>
int N;
int A[114514];
int sum[114514];
int main(void) {
  int i, j, k;
  int ans = 0;
  if (scanf("%d", &N) != 1) return 1;
  for (i = 1; i <= N; i++) {
    if (scanf("%d", &A[i]) != 1) return 1;
    sum[i] = sum[i - 1] + A[i];
  }
  for (i = 1; i <= N; i++) {
    for (j = i; j <= N; j++) {
      int s = sum[j] - sum[i - 1];
      int ok = 1;
      for (k = i; k <= j; k++) {
        if (s % A[k] == 0) {
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#include <stdio.h>

int N;
int A[114514];

int sum[114514];

int main(void) {
	int i, j, k;
	int ans = 0;
	if (scanf("%d", &N) != 1) return 1;
	for (i = 1; i <= N; i++) {
		if (scanf("%d", &A[i]) != 1) return 1;
		sum[i] = sum[i - 1] + A[i];
	}
	for (i = 1; i <= N; i++) {
		for (j = i; j <= N; j++) {
			int s = sum[j] - sum[i - 1];
			int ok = 1;
			for (k = i; k <= j; k++) {
				if (s % A[k] == 0) {
					ok = 0;
					break;
				}
			}
			if (ok) ans++;
		}
	}
	printf("%d\n", ans);
	return 0;
}

/*

制約が小さいから全探索

*/

Submission Info

Submission Time	2026-03-05 07:42:00
Task	B - No-Divisible Range
User	mikecat
Language	C23 (GCC 14.2.0)
Score	200
Code Size	580 Byte
Status	AC
Exec Time	1 ms
Memory	1776 KiB

Judge Result

Set Name

Sample

All

Score / Max Score

0 / 0

200 / 200

Status

× 2

× 25

Set Name	Test Cases
Sample	example_00.txt, example_01.txt
All	example_00.txt, example_01.txt, hand_00.txt, hand_01.txt, hand_02.txt, hand_03.txt, hand_04.txt, hand_05.txt, hand_06.txt, hand_07.txt, random_00.txt, 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, random_13.txt, random_14.txt

Case Name	Status	Exec Time	Memory
example_00.txt	AC	0 ms	1640 KiB
example_01.txt	AC	0 ms	1716 KiB
hand_00.txt	AC	0 ms	1640 KiB
hand_01.txt	AC	1 ms	1636 KiB
hand_02.txt	AC	0 ms	1676 KiB
hand_03.txt	AC	0 ms	1596 KiB
hand_04.txt	AC	0 ms	1616 KiB
hand_05.txt	AC	0 ms	1616 KiB
hand_06.txt	AC	0 ms	1668 KiB
hand_07.txt	AC	0 ms	1776 KiB
random_00.txt	AC	0 ms	1644 KiB
random_01.txt	AC	0 ms	1640 KiB
random_02.txt	AC	0 ms	1604 KiB
random_03.txt	AC	0 ms	1636 KiB
random_04.txt	AC	0 ms	1668 KiB
random_05.txt	AC	0 ms	1616 KiB
random_06.txt	AC	0 ms	1776 KiB
random_07.txt	AC	0 ms	1640 KiB
random_08.txt	AC	0 ms	1636 KiB
random_09.txt	AC	0 ms	1596 KiB
random_10.txt	AC	0 ms	1716 KiB
random_11.txt	AC	1 ms	1636 KiB
random_12.txt	AC	0 ms	1640 KiB
random_13.txt	AC	0 ms	1716 KiB
random_14.txt	AC	0 ms	1716 KiB