HDU 4349 Xiao Ming's Hope lucas定理
2015-08-20 19:59
281 查看
[b]Xiao Ming's Hope[/b]
Time Limit:1000MS Memory Limit:32768KB
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<=10 8)
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
题意:
求C (n,0),C (n,1),C (n,2)...C (n,n).中的奇数个数
题解:
lucas定理,
代码狗
Time Limit:1000MS Memory Limit:32768KB
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<=10 8)
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
题意:
求C (n,0),C (n,1),C (n,2)...C (n,n).中的奇数个数
题解:
lucas定理,
#include<cstdio> using namespace std; int main() { int n; while(~scanf("%d",&n)!=EOF) { int num=0; int ans=1; while(n) { if(n%2==1)num++; n/=2; } for(int i=1;i<=num;i++)ans*=2; printf("%d\n",ans); } }
代码狗
相关文章推荐
- 转 Linux调优方案,sysctl.conf的设置
- Linux eject弹出光驱
- Mac使用zsh后多次执行`source .bash_profile`解决方案
- wps for linux 不能使用中文输入法
- linux中的块缓冲
- Linux里UDP协议 广播和接收测试 C语言
- 选取命令:cut,grep
- ubuntu 12.04 KDE(Kool Desktop Environment,桌面环境)的安装
- Linux文件结构
- Linux系统编程——进程同步与互斥:System V 信号量
- Linux dd命令
- Linux中查看CPU信息
- Linux 添加PPA源
- 【Linux系统编程】 浅谈标准I/O缓冲区
- Linux 开机自动挂载windows分区
- linux无锁编程
- Linux下如何查看系统启动时间和运行时间
- 分享一些不错的学习IOS资源网站
- 7 Strace Examples to Debug the Execution of a Program in Linux
- Opencv TLD VS2012