Luogu P3812 模板线性基

Posted 2021-02-20 hn-wrp

线性基板子题

#include <cstdio>
using namespace std;
#define R register
#define LL long long
LL p[52];
LL n;
inline void ins(LL x)
{
	for(R int i=51;i>=0;i--)
	{
		if(x&(1LL<<i)) {
            if(!p[i]) { p[i]=x; return ;}
            else x^=p[i];
        }
	}
}
int main()
{	
	scanf("%lld",&n);
	LL x,ans=0;
	for(R int i=1;i<=n;i++) {
		scanf("%lld",&x);
		ins(x);
	}
	for(R int i=51;i>=0;i--) if((ans^p[i])>ans) ans^=p[i];
	printf("%lld
",ans);
	return 0;
}