zoj 3591 Nim

/*博弈NIM，注意最后统计的时候应该先将nim数组排序，然后统计nim[i]相同的个数，否则会tle*/
#include<iostream>
#include<string.h>
#include<algorithm>
using namespace std;
long long N = 0, S = 0, W = 0;
#define MAXN 1000000
long long a[MAXN],nim[MAXN];
void init()
{
	int g = S;
	for (int i = 0; i<N; i++) {
		a[i] = g;
		if (a[i] == 0) { a[i] = g = W; }
		if (g % 2 == 0) { g = (g / 2); }
		else           { g = (g / 2) ^ W; }
	}
}
int main()
{
	int testn = 0,k=0,i=0,j=0;
	cin >> testn;
	for (k = 0; k < testn; k++)
	{
		cin >> N >> S >> W;
		memset(a,0,sizeof(a));
		memset(nim, 0, sizeof(0));
		init();
		long long num = N*(N + 1) / 2;
		nim[0] = a[0];
		for ( i = 1; i <N; i++)
		{
			nim[i] = nim[i - 1] ^ a[i];
		}
		long long  cn = 0;
		for (i = 0; i < N; i++)
		{
			if (nim[i] == 0)
				cn++;
		}
		num -= cn;
		sort(nim, nim + N);
		int len = 1;
		for ( i = 1; i < N; i++)
		{
			if (nim[i] ==nim[i - 1])
				len++;
			else
			{
				num -= len*(len - 1) / 2;
				len = 1;
			}
		}
		num -= len*(len - 1) / 2;
		cout << num << endl;	
	}

}
/*
2
3 1 1
3 2 1


*/