|
Key SetTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 1624 Accepted Submission(s): 866
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
Sample Output
|
题意:求{1,2,...,n}的和为偶数的非空子集个数.
假设有m个奇数,p个偶数,偶数随便拿:2^p.奇数只能拿0,2,4,6..个,所以是
C(m,0)+C(m,2)+C(m,4)+...=2^(m-1),减去空集个数1就是答案.
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
#define mod 1000000007
int n;
long long qpow (long long a, long long b) {
if (b == 0)
return 1;
long long ans = qpow (a, b>>1);
ans = ans*ans%mod;
if (b&1)
ans = ans*a%mod;
return ans;
}
long long solve () {
long long m = (n+1)/2, p = n-m;
return qpow (2, p)*qpow (2, m-1)%mod-1;
}
int main () {
//freopen ("in.txt", "r", stdin);
int t;
scanf ("%d", &t);
while (t--) {
cin >> n;
cout << (solve ()+mod)%mod << endl;
}
return 0;
}