Key Set
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 753 Accepted Submission(s): 462
Problem Description
soda has a set
S
with
n
integers
{1,2,…,n}
. A set is called key set if the sum of integers in the set is an even number. He wants to know how many nonempty subsets of
S
are key set.
Input
There are multiple test cases. The first line of input contains an integer
T
(1≤T≤105)
, indicating the number of test cases. For each test case:
The first line contains an integer n (1≤n≤109) , the number of integers in the set.
The first line contains an integer n (1≤n≤109) , the number of integers in the set.
Output
For each test case, output the number of key sets modulo 1000000007.
Sample Input
4 1 2 3 4
Sample Output
0 1 3 7
Source
求2^(n-1)-1
#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
#define ll long long
long long mod = 1000000007;
ll cal(int n){
ll x = 1;
ll p = 2;
n--;
while(n){
if(n&1) x = x*p%mod;
p = p*p%mod;
n/=2;
}
return (x-1+mod)%mod;
}
int main(){
int n,t;
cin>>t;
while(t--){
cin>>n;
cout<<cal(n)<<endl;
}
return 0;
}