#include<iostream>
#include<math.h>
using namespace std;
int main()
{
int t,n;
long long result;
cin>>t;
while(t--)
{
cin>>n;
result = pow(2.0,n-1)/2*(n+1);
cout<<result<<endl;
}
return 0;
#include<math.h>
using namespace std;
int main()
{
int t,n;
long long result;
cin>>t;
while(t--)
{
cin>>n;
result = pow(2.0,n-1)/2*(n+1);
cout<<result<<endl;
}
return 0;
}
注:结果一定要用long long 型,int型WR;
Cn0+Cn1+Cn2+Cn3+……+Cnn=(1+1)^n=2^n
1Cn0+2Cn1+3Cn2+4Cn3+……+(n+1)Cnn=(n+2)/2 * 2^n