采用和题解几乎完全一样的代码，结果还是错了？

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll prime[] = { 2,3,5,7,11,13,17,37 };
ll qmul(ll x, ll y, ll p)
{
	ll sum = 0;
	while (y)
	{
		if (y & 1)
			sum = (sum + x) % p;
		x = (x+ x) % p;
		y >>= 1;
	}
	return sum;
}
ll qm(ll a, ll n, ll p)
{
	ll sum = 1;
	while (n)
	{
		if (n & 1)
			sum = qmul(sum,a,p);
		a=qmul(a,a,p);
		n >>= 1;
	}
	return sum;
}
bool mr(ll a, ll p)
{
	ll d = p - 1,r=0;
	while (!(d & 1))
		d >>= 1, r++;
	ll z = qm(a, d, p);
	if (z == 1)return 1;
	for (int i = 0;i < r;i++)
	{
		if (z == p - 1)return true;
		z = qmul(z,z,p);
	}
	return false;

}
void solve()
{
	long long x;cin >> x;
	if (x <= 1)
	{
		cout << "NO"<<"\n";
		return;
	}

	for (int i = 0;i < 8;i++)
	{
		if (x == prime[i])
		{
			cout << "YES" << "\n";
			return;
		}
		if(x%prime[i]==0)
		{
			cout << "NO" << "\n";
			return;
		}
		if (!mr(prime[i],x))
		{
			cout << "NO" << "\n";
			return;
		}
	}
	cout << "YES"<<"\n";
	return;
}
int main()
{
	int t;cin >> t;
	while (t--)
		solve();
}