Perfect Plants

#include <iostream>

using namespace std;

const int N = 1e5 + 5;

int t[N];

bool ok[N];

int gcd(int a, int b) {
	if(a < b) swap(a, b);
	if(b == 0) return a;
	return gcd(b, a%b);
}

int main() {
	int n, x;
	cin >> n >> x;
	for(int i = 1; i <= n; ++i) {
		cin >> t[i];
		if(t[i]%x == 0) ok[i] = true;
	}

	for(int i = 1; i <= n; ++i) {
		if(!ok[i]) continue;
		int k = i;
		while(ok[k]) {
			++k; 
		}
		--k;

		int g = t[i];
		for(int j = i+1; j <= k; ++j) {
			g = gcd(g, t[j]);
		}
		if(g == x) {
			cout << "YES\n";
			return 0;
		}
		i = k+1;
	}

	cout << "NO\n";





}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED

Test 11

Verdict: ACCEPTED

Test 12

Verdict: ACCEPTED

Test 13

Verdict: ACCEPTED

Test 14

Verdict: ACCEPTED

Test 15

Verdict: ACCEPTED

Test 16

Verdict: ACCEPTED

Test 17

Verdict: ACCEPTED

Test 18

Verdict: ACCEPTED

Test 19

Verdict: ACCEPTED

Test 20

Verdict: ACCEPTED