【HDU 4349】【组合数结论 LUCAS定理推广】 Xiao Ming's Hope【C[n][m]为奇数的个数】t

传送门：HDU 4349 Xiao Ming's Hope

描述：

Xiao Ming's Hope

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

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
  
  

 

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).当中有多少个奇数(1<=n<=10^8) 

思路：

第一种想法是Lucas定理推导，我们分析一下 C(n,m)%2,那么由lucas定理，我们可以写成二进制的形式观察，比如 n=1001101，m是从000000到1001101的枚举，我们知道在该定理中C(0,1)=0,因此如果n=1001101的0对应位置的m二进制位为1那么C(n,m) % 2==0,因此m对应n为0的位置只能填0，而1的位置填0，填1都是1（C(1,0)=C(1,1)=1)，不影响结果为奇数，并且保证不会出n的范围，因此所有的情况即是n中1位置对应m位置0，1的枚举，那么结果很明显就是：2^(n中1的个数)。

在这里给出一个判断组合数奇偶性的一个规律：如果(n&m)==m，那么C(n,m)为奇数，否则为偶数 

这就引出第二种想法，按照二进制考虑&运算，(n&m)==m(m<=n)那么n二进制位为1的m对应的二进制位可以是0或者1，n二进制位为0的m对应的二进制位只可能为0，这样就能保证m与完n之后还是m，做法和第一种是一样的

代码：

#include <bits/stdc++.h>
  #define pr(x) cout << #x << "= " << x << "  " ；
  #define pl(x) cout << #x << "= " << x << endl;
  using  namespace  std;

  int  main(){
    int n;
    while(~scanf("%d",&n)){
      int cnt=0;
      while(n){
        if(n&1)cnt++;
        n>>=1;
      }
      printf("%d\n", 1<<cnt);
    }
    return 0;
  }