CodeForces 579A Raising Bacteria
来源:互联网 发布:网络机顶盒要多少钱 编辑:程序博客网 时间:2024/05/16 05:45
Description
You are a lover of bacteria. You want to raise some bacteria in a box.
Initially, the box is empty. Each morning, you can put any number of bacteria into the box. And each night, every bacterium in the box will split into two bacteria. You hope to see exactly x bacteria in the box at some moment.
What is the minimum number of bacteria you need to put into the box across those days?
Input
The only line containing one integer x (1 ≤ x ≤ 109).
Output
The only line containing one integer: the answer.
Sample Input
5
2
8
1
Hint
For the first sample, we can add one bacterium in the box in the first day morning and at the third morning there will be 4 bacteria in the box. Now we put one more resulting 5 in the box. We added 2 bacteria in the process so the answer is 2.
For the second sample, we can put one in the first morning and in the 4-th morning there will be 8 in the box. So the answer is 1.
x 的二进制表示中所有的 1 的个数就是答案,因为每天晚上细菌的数量会加倍,表现在二进制上面就是 1<<2,1的个数没有变,只是位置左移了,所以二进制表示中所有的1 都是添加进去的。 1 的个数也就是answer
#include <iostream>using namespace std;int main(){int x,i,j,ans = 0;cin>>x;while(x){if(x%2==1)ans ++;x=x/2;}cout<<ans<<endl;return 0;}
- CodeForces 579A - Raising Bacteria
- CodeForces 579A Raising Bacteria
- codeforces 579A Raising Bacteria
- Raising Bacteria CodeForces - 579A
- CodeForces 579A Raising Bacteria (水)
- Codeforces 579A. Raising Bacteria(位运算)
- Codeforces Round #320 (Div. 2) 579A Raising Bacteria(脑洞)
- Codeforces Round #320 (Div. 2) 579A. Raising Bacteria
- codeforces—— 579A —— Raising Bacteria
- coderforce 579A Raising Bacteria
- Codeforces 320A - Raising Bacteria(思维)
- A. Raising Bacteria
- Codeforces Round #320 (Div. 2) A. Raising Bacteria
- Codeforces Round #320 (Div. 2) A. Raising Bacteria
- codeforces #320 div2A Raising Bacteria
- Code Forces 579 A. Raising Bacteria(位运算)
- Codeforces Round #320 (Div. 2) [Bayan Thanks-Round]A Raising Bacteria
- Raising Bacteria
- Copy List with Random Pointer
- 【Leetcode】Sum Root to Leaf Numbers
- BZOJ4319: cerc2008 Suffix reconstruction Suffix Array 的理解
- java实现Quartz定时功能
- 对编程的敬畏之心
- CodeForces 579A Raising Bacteria
- 【Leetcode】Binary Tree Paths
- 快速求幂(二分求幂)
- 三大框架的概述
- QtNetwork: No such file or directory 问题的解决办法
- 2015年研究生数模[D]的后记
- ubuntu14.04 安装Docker
- 0019.scala正则表达式
- Unable to start the virtual deice. The virtual device got no IP address.