HDOJ 题目4349 Xiao Ming's Hope(找规律)
2015-04-28 16:35
239 查看
Xiao Ming's Hope
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1515 Accepted Submission(s): 1015
Problem Description
Xiao Ming likes counting numbers very much, especially he is fond of counting odd numbers. Maybe he thinks it is the best way to show he is alone without a girl friend. The day 2011.11.11 comes. Seeing classmates walking with their girl friends, he coundn't
help running into his classroom, and then opened his maths book preparing to count odd numbers. He looked at his book, then he found a question "C(n,0)+C(n,1)+C(n,2)+...+C(n,n)=?". Of course, Xiao Ming knew the answer,
but he didn't care about that , What he wanted to know was that how many odd numbers there were? Then he began to count odd numbers. When n is equal to 1, C(1,0)=C(1,1)=1, there are 2 odd numbers. When n is equal to 2, C(2,0)=C(2,2)=1,
there are 2 odd numbers...... Suddenly, he found a girl was watching him counting odd numbers. In order to show his gifts on maths, he wrote several big numbers what n would be equal to, but he found it was impossible to finished his tasks, then he sent a
piece of information to you, and wanted you a excellent programmer to help him, he really didn't want to let her down. Can you help him?
Input
Each line contains a integer n(1<=n<=108)
Output
A single line with the number of odd numbers of C(n,0),C(n,1),C(n,2)...C(n,n).
Sample Input
1 2 11
Sample Output
2 2 8
Author
HIT
Source
2012 Multi-University Training Contest 5
Recommend
zhuyuanchen520 | We have carefully selected several similar problems for you: 4340 4348 4347 4346 4345
题意:求C(n,0),C(n,1),C(n,2)...C(n,n).当中有多少个奇数。
就是n转化为二进制后又多少个1,就是2的多少次方
ac代码
#include<stdio.h> #include<string.h> #include<math.h> int cot(int x) { int ans=0; while(x) { int temp=x%2; if(temp) ans++; x/=2; } return ans; } int qpow(int a,int b) { int ans=1; while(b) { if(b&1) ans*=a; a*=a; b/=2; } return ans; } int main() { int n; while(scanf("%d",&n)!=EOF) { printf("%d\n",qpow(2,cot(n))); } }
相关文章推荐
- hdu 4349 Xiao Ming's Ho
- hdoj 4349 Xiao Ming's Hope 【lucas 推广】
- HDOJ 4349 Xiao Ming's Hope (Lucas定理变形)
- HDU 4349 Xiao Ming's Hope 组合数学
- HDOJ 题目3966 Aragorn's Story(树链剖分,树状数组)
- HDOJ 题目4738 Caocao's Bridges(双联通,求桥)
- hdoj 2200 Eddy's AC难题 【找规律】
- hdoj Xiao Ming's Hope 4349 (Lucae定理拓展)
- 1011_Xiao_Ming's_Hope
- hdu 4349 Xiao Ming's Hope,lucas定理
- hdoj 2732 Leapin' Lizards 【拆点网路流】 【题目数据坑。。。】
- hdu - 4349 - Xiao Ming's Hope - 大大的Lucas定理 && 小小的乘法逆元
- HDOJ 题目2852 KiKi's K-Number(线段树求大于a的第k值)
- HDU 4349 Xiao Ming's Hope 2012 Multi-University Training Contest 5
- HDOJ题目3729 I'm Telling the Truth(二分图)
- FZU 1150 Farmer Bill's Problem(逻辑推理题目)
- 【后缀数组】 HDOJ 5030 Rabbit's String
- HDOJ-2200-Eddy's AC难题(组合数)
- hdu1525-------Euclid's Game 找规律
- hdoj-5591-ZYB's Game