HDU6304 Chiaki Sequence Revisited 等差数列 乘法逆元

HDU6304

可参考的题解

//702MS	1372K
#include <bits/stdc++.h>
using namespace std;
const int MAX=1e5+1;
const long long MOD=1e9+7;
long long two[60];
void read(long long &x)
{
    x=0;char s=getchar();
    while (s<'0'||s>'9'){s=getchar();}
    while (s<='9'&&s>='0'){x=x*10+s-'0';s=getchar();}
    x--;
}
long long g(long long x)
{
    if(x<=1) return x;
    else return g(x/2)+x;
}
int main()
{
    long long n;
    int m;
    two[0]=1;
    long long inv2=(MOD+1)/2;
    for(long long k=1;k<=log(1e18)/log(2);k++) two[k]=two[k-1]*2;
    scanf("%d",&m);
    while (m--)
    {
        read(n);
        long long l=max((long long)0,n/2-30),r=min(n,n/2+30),x,p=-1,sum=1;
        while(l<=r)
        {
            x=(l+r)/2;
            if(g(x)>n) r=x-1;
            else l=x+1,p=x;
        }
        for(long long k=0;k<=log(n)/log(2);k++)
        {
            long long t=0;
            x=p/two[k];
            t=x%2==0?x-1:x;
            x=(1+t)%MOD;
            x=x*inv2%MOD;
            x=x*x%MOD;
            x=(x*(two[k]%MOD))%MOD;
            x=x*(k+1)%MOD;
            sum=(sum+x)%MOD;
        }
        x=((n%MOD)-(g(p)%MOD)+MOD)%MOD;
        x=(x*((p+1)%MOD))%MOD;
        sum=(sum+x)%MOD;
        printf("%I64d\n",sum);
    }
    return 0;
}