Python3 解法, 执行用时: 223ms, 内存消耗: 16320K, 提交时间: 2022-04-29 17:20:51

T = int(input())
s = list(map(int, input().split()))
l = len(s)
for x in range(l):
    for y in range(x + 1, l):
        for z in range(y + 1, l):
            for w in range(z + 1, l):
                if s[x] ^ s[y] ^ s[z] ^ s[w] == 0:
                    print('Yes')
                    exit(0)
print('No')

C++(clang++11) 解法, 执行用时: 22ms, 内存消耗: 1676K, 提交时间: 2021-04-02 16:39:46

#include<bits/stdc++.h>
using namespace std;
int f[100005], a[100005],n;
int main(){
	scanf("%d",&n);
	for (int i=1;i<=n;i++)
	scanf("%d",&a[i]);
	for (int i=1;i<n;i++)
	for (int j=i+1;j<=n;j++)
	if (++f[a[i]^a[j]]==2){
		printf("Yes\n");
		return 0;
	}
		printf("No\n");
}