Chiaki Sequence Revisited

找規律而後二分就能夠了html   #include<cstdio> #include<iostream> const int maxn = 1000; typedef long long ll; const int mod = 1e9 + 7; inline ll calc(ll x){ ll sum=0; for(ll j=0;1ll<<j<=x;++j){ sum=sum+(x>>j
相關文章
相關標籤/搜索