(cache)Submission #76116432 - AtCoder Beginner Contest 450

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

Submission #76116432

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
27
28
29
#include <stdio.h>
#include <stdlib.h>
int cmp(const void* x, const void* y) {
  int a = *(const int*)x, b = *(const int*)y;
  return (a > b) - (a < b);
}
int N, K;
int A[212345];
int main(void) {
  int i;
  int ans;
  if (scanf("%d%d", &N, &K) != 2) return 1;
  for (i = 0; i < N; i++) {
    if (scanf("%d", &A[i]) != 1) return 1;
    A[i] %= K;
  }
  qsort(A, N, sizeof(*A), cmp);
  ans = A[N - 1] - A[0];
  for (i = 1; i < N; i++) {
    int candidate = A[i - 1] + K - A[i];
    if (candidate < ans) ans = candidate;
  }
  printf("%d\n", ans);
  return 0;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#include <stdio.h>
#include <stdlib.h>

int cmp(const void* x, const void* y) {
	int a = *(const int*)x, b = *(const int*)y;
	return (a > b) - (a < b);
}

int N, K;
int A[212345];

int main(void) {
	int i;
	int ans;
	if (scanf("%d%d", &N, &K) != 2) return 1;
	for (i = 0; i < N; i++) {
		if (scanf("%d", &A[i]) != 1) return 1;
		A[i] %= K;
	}
	qsort(A, N, sizeof(*A), cmp);
	ans = A[N - 1] - A[0];
	for (i = 1; i < N; i++) {
		int candidate = A[i - 1] + K - A[i];
		if (candidate < ans) ans = candidate;
	}
	printf("%d\n", ans);
	return 0;
}

Submission Info

Submission Time	2026-05-25 07:36:08
Task	D - Minimize Range
User	mikecat
Language	C23 (GCC 14.2.0)
Score	400
Code Size	570 Byte
Status	AC
Exec Time	33 ms
Memory	3200 KiB

Judge Result

Set Name

Sample

All

Score / Max Score

0 / 0

400 / 400

Status

× 2

× 44

Set Name	Test Cases
Sample	00_sample_01.txt, 00_sample_02.txt
All	00_sample_01.txt, 00_sample_02.txt, 01_01.txt, 01_02.txt, 01_03.txt, 01_04.txt, 01_05.txt, 01_06.txt, 01_07.txt, 01_08.txt, 01_09.txt, 01_10.txt, 01_11.txt, 01_12.txt, 01_13.txt, 01_14.txt, 01_15.txt, 01_16.txt, 01_17.txt, 01_18.txt, 01_19.txt, 01_20.txt, 02_01.txt, 02_02.txt, 02_03.txt, 02_04.txt, 02_05.txt, 02_06.txt, 02_07.txt, 02_08.txt, 02_09.txt, 02_10.txt, 02_11.txt, 02_12.txt, 03_01.txt, 03_02.txt, 03_03.txt, 03_04.txt, 03_05.txt, 03_06.txt, 03_07.txt, 03_08.txt, 03_09.txt, 03_10.txt

Case Name	Status	Exec Time	Memory
00_sample_01.txt	AC	0 ms	1544 KiB
00_sample_02.txt	AC	0 ms	1600 KiB
01_01.txt	AC	16 ms	2268 KiB
01_02.txt	AC	18 ms	2372 KiB
01_03.txt	AC	27 ms	2952 KiB
01_04.txt	AC	15 ms	2312 KiB
01_05.txt	AC	10 ms	1936 KiB
01_06.txt	AC	7 ms	1928 KiB
01_07.txt	AC	3 ms	1800 KiB
01_08.txt	AC	5 ms	1680 KiB
01_09.txt	AC	22 ms	2532 KiB
01_10.txt	AC	4 ms	1800 KiB
01_11.txt	AC	9 ms	2012 KiB
01_12.txt	AC	15 ms	2192 KiB
01_13.txt	AC	6 ms	1812 KiB
01_14.txt	AC	12 ms	2056 KiB
01_15.txt	AC	8 ms	1960 KiB
01_16.txt	AC	1 ms	1544 KiB
01_17.txt	AC	24 ms	2672 KiB
01_18.txt	AC	22 ms	2524 KiB
01_19.txt	AC	30 ms	3080 KiB
01_20.txt	AC	21 ms	2404 KiB
02_01.txt	AC	0 ms	1660 KiB
02_02.txt	AC	0 ms	1600 KiB
02_03.txt	AC	0 ms	1488 KiB
02_04.txt	AC	0 ms	1492 KiB
02_05.txt	AC	0 ms	1552 KiB
02_06.txt	AC	0 ms	1616 KiB
02_07.txt	AC	13 ms	2824 KiB
02_08.txt	AC	16 ms	2580 KiB
02_09.txt	AC	16 ms	2616 KiB
02_10.txt	AC	13 ms	2576 KiB
02_11.txt	AC	16 ms	2652 KiB
02_12.txt	AC	33 ms	3200 KiB
03_01.txt	AC	33 ms	3088 KiB
03_02.txt	AC	33 ms	3096 KiB
03_03.txt	AC	33 ms	3136 KiB
03_04.txt	AC	33 ms	3136 KiB
03_05.txt	AC	33 ms	3164 KiB
03_06.txt	AC	32 ms	3164 KiB
03_07.txt	AC	33 ms	3128 KiB
03_08.txt	AC	32 ms	3136 KiB
03_09.txt	AC	33 ms	3088 KiB
03_10.txt	AC	33 ms	3088 KiB