HDU 5363 (数学 水~)

原创 2016年05月31日 15:57:06

 

Key Set

Time 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 (1T105), indicating the number of test cases. For each test case:

The first line contains an integer n (1n109), 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
 

题意:求{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;
}


版权声明:本文为博主原创文章,未经博主允许不得转载。

相关文章推荐

HDU Problem - 5363 Key Set 【快速幂】

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

hdu 5363 Key Set【快速幂求余】

Key Set Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others) Tota...

HDU 5363 Key Set【快速幂取模】

Key Set Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others) Tota...

HDU 5363(2015多校6)-Key Set(快速幂取模)

题目地址:HDU 5363 题意:给你一个具有n个元素的集合S{1,2,…,n},问集合S的非空子集中元素和为偶数的非空子集有多少个。 思路:解释转自[queuelovestack的专栏]因为集合...

HDU 5363 Average(贪心+脑洞)

Average Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others) Total ...

HDU 5363 Key Set

HDU 5363 Key SetProblem Description soda has a set SS with n integers {1,2,…,n }. A set is called k...

Key Set 【hdu-5363】【快速幂】

Key Set Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others) Tota...

HDU:2073 无限的路(数学,水)

无限的路 Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Sub...

NYU EL5363 PRINCS OF COMMUNI NTWK

  • 2011-09-09 23:10
  • 347KB
  • 下载

HDU 4498 Function Curve(数学)

Function Curve Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65535/65535 K (Java/Others) ...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:深度学习:神经网络中的前向传播和反向传播算法推导
举报原因:
原因补充:

(最多只允许输入30个字)