QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #136787 | #241. Chiaki Sequence Revisited | PlentyOfPenalty# | 100 ✓ | 151ms | 3636kb | C++20 | 603b | 2023-08-09 11:28:20 | 2023-08-09 11:28:23 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
const int mod=1e9+7,i2=(mod+1>>1);
int T,ans;
long long n,l,r,mid;
long long Calc(long long x){
long long ret=0;
for(int i=0;i<64;++i)ret+=(x>>i);
return ret;
}
int Sum(long long x){
return (x%mod)*((x+1)%mod)%mod*i2%mod;
}
int main(){
scanf("%d",&T);
while(T--){
scanf("%lld",&n),--n,ans=1;
l=1,r=n;
while(l<r){
mid=(l+r>>1);
if(Calc(mid)>=n)r=mid;
else l=mid+1;
}
for(int i=0;i<64;++i)ans=(ans+(1ll<<i)%mod*Sum((l-1)>>i))%mod;
ans=(ans+(l%mod)*(n-Calc(l-1)))%mod;
printf("%d\n",ans);
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 151ms
memory: 3636kb
input:
100000 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 1...
output:
1 2 4 6 9 13 17 21 26 32 38 45 53 61 69 77 86 96 106 117 129 141 153 166 180 194 209 225 241 257 273 289 306 324 342 361 381 401 421 442 464 486 509 533 557 581 605 630 656 682 709 737 765 793 822 852 882 913 945 977 1009 1041 1073 1105 1138 1172 1206 1241 1277 1313 1349 1386 1424 1462 1501 1541 158...
result:
ok 100000 lines