Key Set
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 1713 Accepted Submission(s): 905
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
Author
zimpha@zju
Source
找啊找啊找规律
规律是an=2^(n-1)-1
#include<stdio.h>
#include<string.h>
#define Mod 1000000007
__int64 qp(__int64 n,__int64 m)
{
__int64 ans=1;
while(m)
{
if(m&1)
ans=ans*n%Mod;
n=n*n%Mod;
m>>=1;
}
return ans;
}
int main()
{
__int64 n,T;
scanf("%I64d",&T);
while(T--)
{
scanf("%I64d",&n);
printf("%I64d\n",qp(2,n-1)-1);
}
return 0;
}