题目链接
从N个人中选一个队长有N种情况,剩下的N-1个人每个人有选和不选两种情况,所以答案为N*2^(N-1)。
附上AC代码:
#include<iostream>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<cstdio>
#include<queue>
#include<set>
#include<vector>
#include<map>
#include<string>
#include<cmath>
#define pq priority_queue
#define Pi acos(-1.0)
#define MAXX 1000000007
using namespace std;
long long two(int x)
{
long long ans=1,gg=2;
while(x)
{
if(x%2)
ans=(ans*gg)%MAXX;
x=x/2;
gg=(gg*gg)%MAXX;
}
return ans;
}
int main()
{
int T,t=0,n;
cin>>T;
while(t++<T)
{
cin>>n;
printf("Case #%d: ",t);
cout<<(1LL*n*two(n-1))%MAXX<<endl;
}
return 0;
}
Memory: 0 KB Time: 0 MS
Language: C++ 4.8.2 Result: Accepted