51nod 1310 Chandrima and XOR

题目
题解

#include<bits/stdc++.h>
using namespace std;
const int M=1e9+7,mxf=88;
typedef long long ll;
int n,l,r,mid,mx,i,XOR[mxf];
ll fi[mxf],pw[mxf],x,ans;
inline char gc(){
    static char buf[100000],*p1=buf,*p2=buf;
    return p1==p2&&(p2=(p1=buf)+fread(buf,1,100000,stdin),p1==p2)?EOF:*p1++;
}
#define gc getchar
inline ll read(){
    ll x=0,fl=1;char ch=gc();
    for (;ch<48||ch>57;ch=gc())if(ch=='-')fl=-1;
    for (;48<=ch&&ch<=57;ch=gc())x=(x<<3)+(x<<1)+(ch^48);
    return x*fl;
}
int main(){
    n=read();
    pw[0]=fi[0]=fi[1]=1;pw[1]=2;
    for (i=2;i<mxf;i++) pw[i]=pw[i-1]*2%M,fi[i]=fi[i-1]+fi[i-2];//fi不能mod
    while (n--){
        x=read();
        while (x){
            l=0;r=mxf;
            while (l<r){
                mid=l+r+1>>1;
                if (fi[mid]<=x) l=mid;
                else r=mid-1;
            }
            XOR[l-1]^=1;
            mx=max(mx,l);
            x-=fi[l];
        }
    }
    for (i=0;i<mx;i++) ans=(ans+pw[i]*XOR[i])%M;
    printf("%lld",ans);
}