Submission #1693034


Source Code Expand

#include<cstdio>
#include<algorithm>
using namespace std;
inline char tc(void){
	static char fl[10000],*A=fl,*B=fl;
	return A==B&&(B=(A=fl)+fread(fl,1,10000,stdin),A==B)?EOF:*A++;
}
inline int read(void){
	int a=0;static char c;
	while((c=tc())<'0'||c>'9');
	while(c>='0'&&c<='9')a=a*10+c-'0',c=tc();
	return a;
}
int n,k,a[100001],g,mx;
int gcd(int a,int b){
	return a%b==0?b:gcd(b,a%b);
}
int main(void){
	register int i;
	n=read(),k=read();
	for(i=1;i<=n;++i)
		a[i]=read(),mx=max(mx,a[i]);
	if(n==1)
		if(a[1]==k){
			puts("POSSIBLE");
			return 0;
		}else {
			puts("IMPOSSIBLE");
			return 0;
		}
	g=a[1];
	for(i=2;i<=n;++i)
		g=gcd(g,a[i]);
	if(mx>=k&&k%g==0){
		puts("POSSIBLE");
		return 0;
	}
	puts("IMPOSSIBLE");
	return 0;
}

Submission Info

Submission Time
Task A - Getting Difference
User Axcosin
Language C++14 (GCC 5.4.1)
Score 300
Code Size 775 Byte
Status AC
Exec Time 3 ms
Memory 512 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 300 / 300
Status
AC × 4
AC × 19
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 1 ms 128 KB
sample_02.txt AC 1 ms 128 KB
sample_03.txt AC 1 ms 128 KB
sample_04.txt AC 1 ms 128 KB
subtask_1_01.txt AC 1 ms 128 KB
subtask_1_02.txt AC 1 ms 128 KB
subtask_1_03.txt AC 3 ms 512 KB
subtask_1_04.txt AC 3 ms 512 KB
subtask_1_05.txt AC 2 ms 384 KB
subtask_1_06.txt AC 1 ms 256 KB
subtask_1_07.txt AC 2 ms 384 KB
subtask_1_08.txt AC 3 ms 512 KB
subtask_1_09.txt AC 2 ms 384 KB
subtask_1_10.txt AC 2 ms 512 KB
subtask_1_11.txt AC 3 ms 512 KB