B3717 组合数问题，快速幂，逆元，组合数

#include<bits/stdc++.h>
using ll = long long;
using namespace std;

const int N = 5e6 + 10;
const int mod = 998244353;
int fac[N],inv[N];

int qmi(int a,int b){
	int res = 1;
	while(b){
		if(b & 1) res = res * a % mod;
		
		a = a*a % mod;
		b >>= 1;
	}
	return res;
}

int c(int n,int m){
	if(n == m) return 1;
	int x = fac[n] % mod * inv[m] % mod * inv[n - m] % mod;
	return x % mod; 
}

int main(){
	int t,n;
	scanf("%d%d",&t,&n);
	fac[0] = 1;
	inv[0] = qmi(1,mod-2);
	for(int i = 1; i < N; i++){
		fac[i] = fac[i-1] * (i % mod)%mod;
		fac[i] %= mod;
		inv[i] = qmi(fac[i],mod-2);
	}
	int ans = 0;
	while(t--){
		int a,b;
		scanf("%d%d",&a,&b);
		int x = c(a,b);
		ans ^= x;
	}
	printf("%d",ans);
	return 0;
}