多校6-Key Set
2015-08-09 20:35
543 查看
Key Set
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)
Total Submission(s): 722 Accepted Submission(s): 442
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
Source
2015 Multi-University Training Contest 6
Recommend
wange2014 | We have carefully selected several similar problems for you: 5368 5367 5366 5365 5364
快速幂
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)
Total Submission(s): 722 Accepted Submission(s): 442
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
Source
2015 Multi-University Training Contest 6
Recommend
wange2014 | We have carefully selected several similar problems for you: 5368 5367 5366 5365 5364
快速幂
#include <map> #include <list> #include <climits> #include <cmath> #include <queue> #include <stack> #include <string> #include <cstdio> #include <cstring> #include <cstdlib> #include <iostream> #include <algorithm> using namespace std; #define eps 1e-9 #define LL long long #define PI acos(-1.0) #define INF 0x3f3f3f3f #define CRR fclose(stdin) #define CWW fclose(stdout) #define RR freopen("input.txt","r",stdin) #define WW freopen("output.txt","w",stdout) const int Max = 10010; const int Mod = 1000000007; LL pow_mod(LL n) { LL res=1; LL a=2; while(n) { if(n&1) { res=(res*a)%Mod; } a=(a*a)%Mod; n>>=1; } return res; } int main() { int T; scanf("%d",&T); LL n; while(T--) { scanf("%I64d",&n); printf("%I64d\n",pow_mod(n-1)-1); } return 0; }
相关文章推荐
- Cake (hdu 5355 构造+dfs)
- OC:面向对象的编程思想、基本的知识点总结、强,弱引用
- 高效算法——M 扫描法
- ACM雷达安放问题
- 多校6-Key Set 2015-08-09 20:35 2人阅读 评论(0) 收藏
- 使用GNU工具链进行嵌入式编程(一)
- 使用WebRTC搭建前端视频聊天室——入门篇
- OC中文件操作
- 过河
- 关于Android数据存储方式(一)——SharedPreferences
- 剑指offer_面试题15_链表中倒数第k个节点(考虑问题要全面)
- MFC应用实例:获取应用程序文件的图标
- Delete Node in a Linked List
- 阅读《软件驱邪》调试和优化遗留代码艺术
- (笔试题)把一个整数数组中重复的数字去掉
- Android基础知识----01
- 公式复选框列
- Poj 1182 食物链
- 冒泡排序
- stata学习笔记(三):计算五年内的ROA标准差所用到的一些知识