Submission #1445760

---

Source Code Expand

#include <stdio.h>

int euclid(int a, int b){//a > b
	int c;
	while(1){
		c = a % b;
		if(c == 0){
			return b;
		}
		a = b;
		b = c;
	}
}

int main(void){
	
	
	int n, k;
	scanf("%d%d", &n, &k);
	int max = 0;
	int gcd;
	for(int i = 0; i < n; i++){
		int a;
		scanf("%d", &a);
		if(max < a){
			max = a;
		}
		if(i == 0){
			gcd = a;
		}else if(gcd > a){
			gcd = euclid(gcd, a);
		}else{
			gcd = euclid(a, gcd);
		}
	}
	if(max < k){
		printf("IMPOSSIBLE\n");
		return 0;
	}
	if(k % gcd == 0){
		printf("POSSIBLE\n");
	}else{
		printf("IMPOSSIBLE\n");
	}
	return 0;
}
/*
kが最大値より大きい場合は不可能。
kがすべての数の最大公約数の倍数でなければ不可能。
*/

Submission Info

Judge Result