写个智能栈，每次push和pop是都把栈中最大元素与res进行^运算，

#include <iostream>
#include <cstdio>
#include <iomanip>
#include <string>
#include <cstdlib>
#include <cstring>
#include <queue>
#include <set>
#include <vector>
#include <map>
#include <algorithm>
#include <cmath>
#include <stack>

#define INF 0x3f3f3f3f
#define LINF 0x3f3f3f3f3f3f3f3f
#define ll long long
#define ull unsigned long long
#define uint unsigned int
#define l(x) ((x)<<1)
#define r(x) ((x)<<1|1)
#define lowbit(x) ((x)&-(x))
#define abs(x) ((x)>=0?(x):-(x))
#define ms(a,b) memset(a,b,sizeof(a))

using namespace std;

int n, p, q, m;
unsigned int sa, sb, sc;
unsigned int rng61() {
	sa ^= sa << 16;
	sa ^= sa >> 5;
	sa ^= sa << 1;
	unsigned int t = sa;
	sa = sb;
	sb = sc;
	sc ^= t ^ sa;
	return sc;
}


void gen() {
	scanf("%d%d%d%d%u%u%u", &n, &p, &q, &m, &sa, &sb, &sc);
	ll res = 0,x;
	stack<ll> st;
	for (int i = 1; i <= n; i++) {
		if (rng61() % (q + p) < p) {
			x = rng61() % m + 1;
			if (st.size() == 0 || x > st.top()) st.push(x);
			else st.push(st.top());
		}
		else {
			if (st.size() > 0)st.pop();
		}
		if (st.size() > 0)
			res ^= i*st.top();
	}
	printf("%lld\n", res);
}

int main() {
	int t;
	scanf("%d", &t);
	for (int i = 1; i <= t; i++) {
		printf("Case #%d: ", i);
		gen();
	}

	return 0;
}