sg函数打表找规律。

#include<iostream>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<cstdlib>
#include<climits>
#include<stack>
#include<vector>
#include<queue>
#include<set>
#include<bitset>
#include<map>
//#include<regex>
#include<cstdio>
#pragma GCC optimize(2)
#define up(i,a,b)  for(int i=a;i<b;i++)
#define dw(i,a,b)  for(int i=a;i>b;i--)
#define upd(i,a,b) for(int i=a;i<=b;i++)
#define dwd(i,a,b) for(int i=a;i>=b;i--)
//#define local
typedef long long ll;
typedef unsigned long long ull;
const double esp = 1e-6;
const double pi = acos(-1.0);
const int INF = 0x3f3f3f3f;
const int inf = 1e9;
using namespace std;
ll read()
{
	char ch = getchar(); ll x = 0, f = 1;
	while (ch<'0' || ch>'9') { if (ch == '-')f = -1; ch = getchar(); }
	while (ch >= '0' && ch <= '9') { x = x * 10 + ch - '0'; ch = getchar(); }
	return x * f;
}
typedef pair<int, int> pir;
#define lson l,mid,root<<1
#define rson mid+1,r,root<<1|1
#define lrt root<<1
#define rrt root<<1|1
const int N = 3e5 + 10;
int T;
ll a[N];
int dp[1010][5];
int len, n, x, y, z;
ll mixed(ll i)
{
	return max(i - x, 0ll);
}
ll infantry(ll i)
{
	return max(i - y, 0ll);
}
ll cavalry(ll i)
{
	return max(i - z, 0ll);
}
int mex(int a,int b,int c)
{
	vector<int>s;
	s.push_back(a), s.push_back(b), s.push_back(c);
	sort(s.begin(), s.end());
	s.erase(unique(s.begin(), s.end()), s.end());
	up(i, 0, s.size())if (i^s[i])return i;
	return s.size();
}
void init()
{
	dp[0][0] = dp[0][1] = dp[0][2] = 0;
	upd(i, 1, 1000)
	{
		dp[i][0] = mex(dp[mixed(i)][0], dp[infantry(i)][1], dp[cavalry(i)][2]);
		dp[i][1] = mex(dp[mixed(i)][0], 3, dp[cavalry(i)][2]);
		dp[i][2] = mex(dp[mixed(i)][0], dp[infantry(i)][1], 3);
		if (i > 500)
		{
			int temp = i-500;
			int cnt = 0;
			bool flag = 0;
			up(k,0,5)
			{
				if (!(dp[i-k][0] == dp[500 - k][0] && dp[i - k][1] == dp[500 - k][1] && dp[i - k][2] == dp[500 - k][2]))
				{
					flag = 1;
					break;
				}
			}
			if (!flag)		
			{
				len = i-500;
				break;
			}
		}
	}
}
int sg(ll a,int b)
{
	if (a <= 500)return dp[a][b];
	int temp = (a - 500) % len + 500;
	return dp[temp][b];
}
int main()
{
	T = read();
	while (T--)
	{
		n = read(); x = read(), y = read(), z = read();
		memset(dp, 0, sizeof(dp));
		init();
		upd(i, 1, n)
		{
			a[i] = read();
		}
		int sum = 0;
		upd(i, 1, n)
		{
			sum ^= sg(a[i], 0);
		}
		int ans = 0;
		upd(i, 1, n)
		{
			sum ^= sg(a[i], 0);
			if (!(sum^sg(mixed(a[i]), 0)))ans++;
			if (!(sum^sg(infantry(a[i]), 1)))ans++;
			if (!(sum^sg(cavalry(a[i]), 2)))ans++;
			sum ^= sg(a[i], 0);
		}
		cout << ans << endl;
	}
	return 0;
}