设 l o w b i t ( x ) lowbit(x) lowbit(x)表示 x x x二进制最低位 1 1 1表示的数字
求 ∑ i = 0 2 n l o w b i t ( i ) \sum\limits_{i=0}^{2^n}lowbit(i) i=0∑2nlowbit(i)
0000
0001
0010
0011
0100
0101
0110
0111
1000
如果第 i i i位的二进制要产生贡献,首先第 i i i位上是 1 1 1
且 [ 1 , i − 1 ] [1,i-1] [1,i−1]都是零,而 [ i + 1 , n ] [i+1,n] [i+1,n]随意
贡献是 2 i − 1 ∗ 2 n − i = 2 n − 1 2^{i-1}*2^{n-i}=2^{n-1} 2i−1∗2n−i=2n−1
可以看出与 i i i没有关系
∑ i = 0 2 n − 1 l o w b i t ( i ) = ∑ i = 1 n 2 n − 1 = 2 n − 1 ∗ n \sum\limits_{i=0}^{2^n-1}lowbit(i)=\sum\limits_{i=1}^{n}2^{n-1}=2^{n-1}*n i=0∑2n−1lowbit(i)=i=1∑n2n−1=2n−1∗n
再加上 l o w b i t ( 2 n ) = 2 n lowbit(2^n)=2^n lowbit(2n)=2n就是答案
答案为 2 n − 1 ∗ ( n + 2 ) 2^{n-1}*(n+2) 2n−1∗(n+2)
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int maxn = 2e6+10;
const int mod = 998244353;
int t,n;
int quick(int x,int n)
{
int ans = 1;
for( ; n ; n>>=1,x=x*x%mod )
if( n&1 ) ans = ans*x%mod;
return ans;
}
inline int read()
{
int s=0,w=1;
char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')w=-1;ch=getchar();}
while(ch>='0'&&ch<='9') s=s*10+ch-'0',ch=getchar();
return s*w;
}
inline void out(int a)
{
if(a>=10)out(a/10);
putchar(a%10+'0');
}
signed main()
{
cin >> t;
while( t-- )
{
n = read();
if( n==0 ){ puts("1");continue; }
int ans = (n+2)%mod*quick(2,n-1)%mod;
out(ans); puts("");
}
}