codeforces 579A Raising Bacteria
2015-11-23 12:44
507 查看
A. Raising Bacteria
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 test(s)
Input
5
Output
2
Input
8
Output
1
Note
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.
#include<cstdio> #include<cstdlib> #include<algorithm> using namespace std; int main() { int x,ans=1; scanf("%d",&x); while(x!=1) { if(x&1)ans++; x>>=1; } printf("%d\n",ans); return 0; }
相关文章推荐
- Could not reliably determine the server's fully qualified domain name
- type_traits.h
- stl_pair.h
- MyBatis批量操作报错:Parameter 'xxxList' not found. Available parameters are [list]
- Codeforces Round #185 (Div. 2) C. The Closest Pair 构造
- 多线程(银行存款)使用notify()和wait()线程通信实现交替存款
- 217. Contains Duplicate
- 什么是领域驱动设计(Domain Driven Design)?
- LeetCode OJ——Submission Details
- BZOJ4320: ShangHai2006 Homework
- [AlwaysOn Availability Groups]AlwaysOn等待类型
- Domain Name System (DNS)
- NYOJ 150 Train Problem I
- 快速激活JetBrains系列产品 可以激活WebStorm11
- [AlwaysOn Availability Groups]AG扩展事件
- SSH留言板 com.sun.jersey.api.container.ContainerException 错误
- Jade之Plain Text
- LeetCode 子 Climbing Stairs
- jboss服务启动时报Error creating bean with name'addressService': Injection of autowired dependencies faile
- 【LeetCode OJ 011】Container With Most Water