Submission #1445301


Source Code Expand

#include<cstdio>
#include<algorithm>
using namespace std;
int main()
{
	int n, k, max1 = 0, min1 = 1e9, flag = 1, t = 0, i = 0;
	scanf("%d %d", &n, &k);
	int a[n];
	for(i = 0; i < n; i++)
	{
		scanf("%d", &a[i]);
		max1 = max(max1, a[i]);
		min1 = min(min1, a[i]);
	}
	if(max1 < k || n == 1 && max1 != k) flag = 0;
	t = a[0] % min1;
	for(i = 1; i < n; i++)
	{
		
		if(a[i] % min1 != t) break;
	}
	if(i == n)  flag = 0;
	if(flag)    printf("POSSIBLE\n");
	else    printf("IMPOSSIBLE\n");
	return 0;
}

Submission Info

Submission Time
Task A - Getting Difference
User lazydel
Language C++14 (GCC 5.4.1)
Score 0
Code Size 524 Byte
Status WA
Exec Time 12 ms
Memory 512 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:7:24: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d", &n, &k);
                        ^
./Main.cpp:11:21: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", &a[i]);
                     ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 300
Status
AC × 4
AC × 15
WA × 4
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt
All sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt, sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt, subtask_1_01.txt, subtask_1_02.txt, subtask_1_03.txt, subtask_1_04.txt, subtask_1_05.txt, subtask_1_06.txt, subtask_1_07.txt, subtask_1_08.txt, subtask_1_09.txt, subtask_1_10.txt, subtask_1_11.txt
Case Name Status Exec Time Memory
sample_01.txt AC 0 ms 128 KB
sample_02.txt AC 0 ms 128 KB
sample_03.txt AC 0 ms 128 KB
sample_04.txt AC 0 ms 128 KB
subtask_1_01.txt WA 0 ms 128 KB
subtask_1_02.txt AC 0 ms 128 KB
subtask_1_03.txt AC 12 ms 512 KB
subtask_1_04.txt WA 12 ms 512 KB
subtask_1_05.txt AC 6 ms 384 KB
subtask_1_06.txt AC 2 ms 256 KB
subtask_1_07.txt WA 7 ms 384 KB
subtask_1_08.txt AC 11 ms 512 KB
subtask_1_09.txt AC 5 ms 256 KB
subtask_1_10.txt WA 8 ms 384 KB
subtask_1_11.txt AC 10 ms 512 KB