HDOJ 5363 Key Set (快速幂取模)

Key Set

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

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


   
   一看就出来的规律，但是不知道对不对，写了一下，还真对了= =
ans=2^(n-1)-1

  
  

ac代码：

#include<stdio.h>
#include<string.h>
#include<math.h>
#include<iostream>
#include<algorithm>
#define MAXN 2555
#define mod 1000000007
#define INF 0xfffffff
#define MIN(a,b) a>b?b:a
using namespace std;
long long fun(long long x,long long y)
{
	long long sum=1;
	while(x)
	{
		if(x%2)
		sum=sum*y%mod;
		x/=2;
		y=y*y%mod;
	}
	return sum;
}
int main()
{
	long long t,num;
	scanf("%lld",&t);
	while(t--)
	{
		scanf("%lld",&num);
		long long ans=fun(num-1,2);
		printf("%lld\n",ans-1);
	}
	return 0;
}