杭电-5363 Key Set

最新推荐文章于 2022-07-22 01:11:50 发布

lu_1110

最新推荐文章于 2022-07-22 01:11:50 发布

阅读量224

点赞数

分类专栏： OJ练习

本文链接：https://blog.csdn.net/lu_1110/article/details/52004535

版权

OJ练习专栏收录该内容

218 篇文章 0 订阅

订阅专栏

Key Set

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)

Total Submission(s): 1781 Accepted Submission(s): 937

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

(1≤T≤105) , indicating the number of test cases. For each test case:

The first line contains an integer

(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

Sample Output

Author

zimpha@zju

Source

2015 Multi-University Training Contest 6

Recommend

wange2014

#include<stdio.h>
int quictpow(__int64 m)
{
	int ans=1;
	__int64 base=2;
	while(m>0)
	{
		if(m%2==1)
		{
			ans=(ans*base)%1000000007;
		}
		base=(base*base)%1000000007;
		m=m/2;
	}
	return ans;
}
int main()
{
	int t;
	__int64 n;
	scanf("%d",&t);
	while(t--)
	{
		scanf("%I64d",&n);
		printf("%d\n",quictpow(n-1)-1);
	}
	return 0;
}