Codeforces Round #320 (Div. 2) 579A Raising Bacteria(脑洞)
来源:互联网 发布:软件测试工程师难学不 编辑:程序博客网 时间:2024/05/17 08:38
题目链接:点击打开链接
给你一个盒子里面的细菌数,每个细菌可以分裂成两个细菌,问你最初盒子里面有几个细菌。
相当于问你这个数的二进制表示中有几个1.
AC代码:
#include "iostream"#include "cstdio"#include "cstring"#include "algorithm"using namespace std;int x, ans = 1;int main(int argc, char const *argv[]){ scanf("%d", &x); while(x > 1) { if(x & 1) ans++; x /= 2; } printf("%d\n", ans); return 0;}
1 0
- 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) A. Raising Bacteria
- Codeforces Round #320 (Div. 2) [Bayan Thanks-Round]A Raising Bacteria
- CodeForces 579A - Raising Bacteria
- CodeForces 579A Raising Bacteria
- codeforces 579A Raising Bacteria
- Raising Bacteria CodeForces - 579A
- Raising Bacteria (Codeforces Round #320 (Div. 2) [Bayan Thanks-Round] )
- cf#320 Div.2 Problem A Raising Bacteria
- CodeForces 579A Raising Bacteria (水)
- Codeforces 579A. Raising Bacteria(位运算)
- Codeforces 320A - Raising Bacteria(思维)
- codeforces #320 div2A Raising Bacteria
- codeforces—— 579A —— Raising Bacteria
- coderforce 579A Raising Bacteria
- Codeforces Round #125 (Div. 1) A. About Bacteria
- 内存溢出
- css知多少(10)——display
- hdu 5461 Largest Point
- Apache 服务器安装与配置要点
- 理解CSS的盒子模型和样式继承
- Codeforces Round #320 (Div. 2) 579A Raising Bacteria(脑洞)
- 对DevExpress GridControl控件,实现通过checkbox选中时整行高亮
- 回收键盘相关方法
- 判断链表是否存在环形链表
- 窗口子控件
- 使用NetBeans实现表格的增删改
- 最少拦截系统 1257 (动态规划)
- 关于创建子包(package)的问题
- 关于JDK的终极环境变量的配置