Codeforces Round #320 (Div. 2)(A)
来源:互联网 发布:小米网络助手下载 编辑:程序博客网 时间:2024/05/29 23:24
A. Raising Bacteria
time limit per test 1 second
memory limit per test 256 megabytes
inputstandard input
outputstandard outputYou 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<iostream>using namespace std;int main(void){ int x; while(cin >> x) { int ans = 0; while(x) { if(x&1) ans++; x >>= 1; } cout << ans << endl; } return 0;}
- Codeforces Round #320 (Div. 2)(A)
- Codeforces Round #320 (Div. 2) A. Raising Bacteria
- Codeforces Round #320 (Div. 2)C. A Problem about Polyline
- Codeforces Round #320 (Div. 2) C. A Problem about Polyline
- Codeforces Round #320 (Div. 2) C - A Problem about Polyline
- Codeforces Round #320 (Div. 2) C - A Problem about Polyline
- Codeforces Round #320 (Div. 2) A B C D E
- Codeforces Round #320 (Div. 2)(A~E)
- Codeforces Round #320 (Div. 2) 579A Raising Bacteria(脑洞)
- Codeforces Round #320 (Div. 2) 579A. Raising Bacteria
- Codeforces Round #320 (Div. 2) A. Raising Bacteria
- Codeforces Round #320 (Div. 2) C. A Problem about Polyline
- Codeforces Round #131 (Div. 2) A B
- Codeforces Round #174 (Div. 2) Problem A
- Codeforces Round #173 (Div. 2) A.Bit++
- Codeforces Round #181 (Div. 2) A题
- Codeforces Round #184 (Div. 2) A题
- Codeforces Round #185 (Div. 2)--A,B
- 0127 Flume日志收集
- RPM原理详解-spec文件
- ios深拷贝,浅拷贝,拷贝自定义对象的简单介绍
- 移动前端开发之布局篇
- 正则表达式基本语法
- Codeforces Round #320 (Div. 2)(A)
- list请求参数作为springmvc方法参数
- CentOs 7中安装Vmware tools
- git基础操作
- [c]poj1010 dfs
- 程序员等于=
- APK动态分析解析
- 左右值无限分类 预排序遍历树算法:modified preorder tree traversal algorithm
- 如果你对MySQL数据库还停留在这个印象,那么你就o