#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pii pair<int, int>
#define all(v) v.begin(), v.end()
#define oo 1e9
const int MAX = 1e18 + 8, MOD = 1e9 + 7, LOGMAX = 130;
int n;
int Hcnt[LOGMAX][LOGMAX];
int RHcnt[LOGMAX][LOGMAX];
int binpow(int a, int b){
if(b == 0) return 1;
if(b & 1) return binpow(a, b - 1) % MOD * a % MOD;
else return binpow(a * a % MOD, b / 2) % MOD;
}
int inv(int a){
return binpow(a, MOD - 2);
}
void solve(){
cin >> n;
int ans = 0;
int LG = log2(n);
for(int i = 0; (1ll << i) <= n; i++){
for(int j = 0; j <= LG + i; j++){
Hcnt[i][j] = 0;
RHcnt[i][j] = 0;
}
for(int j = 0; j <= LG - i; j++){
Hcnt[i][j] = (1ll << j);
RHcnt[i][j] = (1ll << max(0ll, j - 1));
}
if(i != 0){
for(int j = 0; j <= LG + i - 1; j++){
RHcnt[i][j + 1] += RHcnt[i - 1][j];
Hcnt[i][j + 1] += RHcnt[i - 1][j];
}
}
// for(int j = 0; j <= LG + i; j++) cout << Hcnt[i][j] << ' ';
// cout << '\n';
int oth = n;
for(int j = 0; j <= LG + i; j++){
oth -= Hcnt[i][j];
ans = (ans + binpow(2, i) * j % MOD * (binpow(2, Hcnt[i][j]) - 1 + MOD) % MOD * binpow(2, oth) % MOD) % MOD;
}
}
cout << ans * inv((binpow(2, n) - 1 + MOD) % MOD) % MOD << '\n';
}
signed main(){
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int t; cin >> t;
while(t--){
solve();
}
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
597 ms |
1048576 KB |
Execution killed with signal 9 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
598 ms |
1048576 KB |
Execution killed with signal 9 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
614 ms |
1048576 KB |
Execution killed with signal 9 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
597 ms |
1048576 KB |
Execution killed with signal 9 |
2 |
Halted |
0 ms |
0 KB |
- |