HDU 4349

Xiao Ming's Hope

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 2451    Accepted Submission(s): 1684

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<=10 ⁸)

 

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)d 到  c（n，n） 的中奇数的个数。

思路： 因为可以非常的大，所以不能用递归的方式求 c（n，m）  那么这里有一个

卢卡斯定理。  简单的说 ， 就是求c（n，m ）对于p取模的数（p是素数） 那么就可以得到  lucas（n，m，mod ）=C(n % mod, m % mod)* lucas(n / mod, m / mod) % mod;

这里的mod  就是p  证明。。。   不会。

在这里推荐一篇  博客 。

挺好的一篇博客

代码： 

#include<stdio.h>
#include<string.h>
#include<iostream>
#include<algorithm>

using namespace std;

int n,m;

int main()
{
	while(cin>>n)
	{
		int sum=0;
		while(n)
		{
			sum+=n&1;
			n>>=1;
		}
		printf("%d\n",1<<sum);
	}
	return 0;
}