hdoj-【5363 Key Set】

Key Set

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others)
Total Submission(s): 1889    Accepted Submission(s): 991

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.

 

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
   
   

   
   
<span style="font-size:18px;">#include<cstdio>
#define mod 1000000007
__int64 quick_pow(__int64 n)
{
	__int64 ant=1,a=2;
	while(n)
	{
		if(n&1)
		{
			ant=ant*a%mod;
		} 
		a=a*a%mod;
		n>>=1;
	} 
	return ant;
} 
int main()
{
	int t;
	scanf("%d",&t);
	while(t--)
	{
		__int64 n;
		scanf("%I64d",&n);
		__int64 ans=quick_pow(n-1); 
		printf("%I64d\n",ans-1); 
	} 
} 
</span>