HDU 4349 Xiao Ming‘s Hope

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 girlfriends, he couldn’t help running into his classroom, and then opened his math 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$$+$$\cdots +$$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 math, 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\le n\le 10^8)$.

Output

  A single line with the number of odd numbers of $C_n^0$$,$$C_n^1$$,$$C_n^2$$,$$\cdots ,$$C_n^n$.

Sample Input

1
2
11

Sample Output

2
2
8

Translation

  给定正整数 $n$，输出 $\sum _{i=0}^n\left[C_n^i\equiv 1(\mathrm{m}\mathrm{o}\mathrm{d}2)\right]$。

Idea

  对于和式的一项 $C_n^i$，设 $i,n$ 为 $k$ 位二进制数（不会产生溢出），$n=\overline{n_k{n}_{k-1}\cdots n_1}$，$i=\overline{i_k{i}_{k-1}\cdots i_1}$。根据卢卡斯定理，可将 $C_n^i$ 拆解。
$$\begin{array}{rl}\left(\begin{array}{c}n\\ i\end{array}\right)& =\left(\begin{array}{c}n\mathrm{m}\mathrm{o}\mathrm{d}2\\ i\mathrm{m}\mathrm{o}\mathrm{d}2\end{array}\right)\times \left(\begin{array}{c}\lfloor \frac{n}{2}\rfloor \\ \lfloor \frac{i}{2}\rfloor \end{array}\right)\\ & =\left(\begin{array}{c}n\mathrm{m}\mathrm{o}\mathrm{d}2\\ i\mathrm{m}\mathrm{o}\mathrm{d}2\end{array}\right)\times \left(\begin{array}{c}\lfloor \frac{n}{2}\rfloor \mathrm{m}\mathrm{o}\mathrm{d}2\\ \lfloor \frac{i}{2}\rfloor \mathrm{m}\mathrm{o}\mathrm{d}2\end{array}\right)\times \left(\begin{array}{c}\lfloor \frac{n}{4}\rfloor \\ \lfloor \frac{i}{4}\rfloor \end{array}\right)\\ & ⋮\\ & =\left(\begin{array}{c}{n}_1\\ i_1\end{array}\right)\times \left(\begin{array}{c}{n}_2\\ i_2\end{array}\right)\times \cdots \times \left(\begin{array}{c}{n}_k\\ i_k\end{array}\right)\\ & =\prod _{j=1}^k\left(\begin{array}{c}{n}_j\\ i_j\end{array}\right)\end{array}$$
  当且仅当 $\forall 1\le j\le k$，有 $\left(\begin{array}{c}{n}_j\\ i_j\end{array}\right)=1$，$C_n^i$ 为奇数。遍历 $n$ 的 $k$ 个二进制位，若 $n_j=1$，那么 $i_j=0$ 或 $i_j=1$，两种选择都满足 $\left(\begin{array}{c}{n}_j\\ i_j\end{array}\right)=1$（产生可行的两个分支，数量 $\times 2$）；若 $n_j=0$，只有 $i_j=0$ 满足 $\left(\begin{array}{c}{n}_j\\ i_j\end{array}\right)=1$（不产生可行的分支，数量 $\times 1$）。设 $cnt$ 为 $n$ 的二进制中 $1$ 的个数，那么答案为 $2^{cnt}$。

代码

#include<bitset>
#include<cstdio>
using namespace std;
int main()
{
	int n;
	while(~scanf("%d",&n))
	{
		//装入bitset
		//调用函数
		//bs.count()表示1的数量
		bitset<64>bs(n);
		printf("%d\n",1<<bs.count());
	}
	return 0;
}