Submission #21802204


Source Code Expand

#include <stdio.h>

long long mod = 1000000007;
long long N, A[1 << 18], Q[1 << 18];
long long Answer = 1;

long long cmpfunc(const void *a, const void *b){
    return (*(long long*)a - *(long long*)b);
}

int main() {
	// Input, Sorting
	scanf("%lld", &N);
	for (int i = 0; i < N; i++) scanf("%lld", &A[i]);
	qsort(A, N, sizeof(long long), cmpfunc);
	Q[0] = A[0];
	for (int i = 1; i < N; i++) Q[i] = A[i] - A[i - 1];

	// Get Answer
	for (int i = 0; i < N; i++) {
		Answer *= (Q[i] + 1LL);
		Answer %= mod;
	}
	printf("%lld\n", Answer);
	return 0;
}

Submission Info

Submission Time
Task B - ARC Wrecker
User E869120
Language C (GCC 9.2.1)
Score 400
Code Size 575 Byte
Status AC
Exec Time 33 ms
Memory 3276 KiB

Compile Error

./Main.c: In function ‘main’:
./Main.c:15:2: warning: implicit declaration of function ‘qsort’ [-Wimplicit-function-declaration]
   15 |  qsort(A, N, sizeof(long long), cmpfunc);
      |  ^~~~~
./Main.c:13:2: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
   13 |  scanf("%lld", &N);
      |  ^~~~~~~~~~~~~~~~~
./Main.c:14:30: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
   14 |  for (int i = 0; i < N; i++) scanf("%lld", &A[i]);
      |                              ^~~~~~~~~~~~~~~~~~~~

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 400 / 400
Status
AC × 3
AC × 22
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt
All in01.txt, in02.txt, in03.txt, in04.txt, in05.txt, in06.txt, in07.txt, in08.txt, in09.txt, in10.txt, in11.txt, in12.txt, in13.txt, in14.txt, in15.txt, in16.txt, in17.txt, in18.txt, in19.txt, sample_01.txt, sample_02.txt, sample_03.txt
Case Name Status Exec Time Memory
in01.txt AC 2 ms 1712 KiB
in02.txt AC 1 ms 1680 KiB
in03.txt AC 1 ms 1620 KiB
in04.txt AC 3 ms 1716 KiB
in05.txt AC 1 ms 1648 KiB
in06.txt AC 1 ms 1632 KiB
in07.txt AC 18 ms 3204 KiB
in08.txt AC 19 ms 3244 KiB
in09.txt AC 26 ms 3276 KiB
in10.txt AC 28 ms 3264 KiB
in11.txt AC 33 ms 3276 KiB
in12.txt AC 33 ms 3208 KiB
in13.txt AC 29 ms 3208 KiB
in14.txt AC 22 ms 3236 KiB
in15.txt AC 25 ms 3276 KiB
in16.txt AC 25 ms 3212 KiB
in17.txt AC 2 ms 1716 KiB
in18.txt AC 1 ms 1648 KiB
in19.txt AC 25 ms 3272 KiB
sample_01.txt AC 1 ms 1712 KiB
sample_02.txt AC 1 ms 1644 KiB
sample_03.txt AC 2 ms 1716 KiB