2020牛客多校第六场B-Binary Vector(线性代数linear algebra)
求逆元异或前缀和
的出题意得线性公式
异或f(1)-f(n)得出答案
Code:
#include<iostream>
#include<cstdio>
#include<cstring>
#include<stack>
#include<algorithm>
#include<vector>
#include<queue>
#include<cmath>
#include<map>
#include<unordered_map>
#include<unordered_set>
#define ll long long
using namespace std;
const int INF=0x3f3f3f3f;
const double pi=acos(-1.0),eps=1e-8;
const int mod=1e9+7;
const int maxn=5e5+10;
const int N=2e7+10;
int n,m,k;
ll a[N];
ll powquick(ll x,ll y)
{
ll ans=1;
while(y)
{
if(y&1)
ans=ans*x%mod;
x=x*x%mod;
y>>=1;
}
return ans;
}
ll inv(ll x)
{
return powquick(x,mod-2);
}
int main()
{
ll inv2=inv(2);
ll ans=0,res=1,sum=inv2;
for(int i=1; i<N; i++)
{
res=res*(1-sum+mod)%mod;//公式
sum=sum*inv2%mod;
ans^=res;
a[i]=ans;
}
int T;
cin>>T;
while(T--)
{
int x;
cin>>x;
cout<<a[x]<<endl;
}
return 0;
}