cf#320 Div.2 Problem A Raising Bacteria
来源:互联网 发布:js 获取浏览器信息 编辑:程序博客网 时间:2024/04/30 18:26
一道简单的十进制数转化为二进制数的问题,答案是二进制数数位上1的个数
#include <iostream>#include <cstdio>#include <cstring>using namespace std;int A[33]={1,2,4,8,16,32,64,128,256,512,1024,2048,4096,8192,16384,32768,65536,131072,262144,524288,1048576,2097152,4194304,8388608,16777216,33554432,67108864,134217728,268435456,536870912};int main(){ int x; scanf("%d",&x); int ans=0; for(int i=29;i>=0;i--){ if(x>=A[i]){ ans++; x-=A[i]; } } printf("%d\n",ans);}
0 0
- cf#320 Div.2 Problem A Raising Bacteria
- Codeforces Round #320 (Div. 2) A. Raising Bacteria
- 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) [Bayan Thanks-Round]A Raising Bacteria
- Codeforces 320A - Raising Bacteria(思维)
- A. Raising Bacteria
- cf#320 Div.2 Problem C A Problem about Polyline
- cf#320 Div.2 Problem C A Problem about Polyline
- Raising Bacteria (Codeforces Round #320 (Div. 2) [Bayan Thanks-Round] )
- CodeForces 579A - Raising Bacteria
- coderforce 579A Raising Bacteria
- CodeForces 579A Raising Bacteria
- codeforces 579A Raising Bacteria
- Raising Bacteria CodeForces - 579A
- codeforces #320 div2A Raising Bacteria
- Raising Bacteria
- Codeforces Round #320 (Div. 2)B. Finding Team Member
- 行列式的几何意义
- HTML&CSS Learning Notes 5
- Leetcode #225 Implement Stack using Queues
- cf#320 Div.2 Problem B Finding Team Member
- cf#320 Div.2 Problem A Raising Bacteria
- 完全卸载oracle11g
- Codeforces #320(div2)
- cf#320 Div.2 Problem C A Problem about Polyline
- 二叉树重建及遍历
- ubuntu彻底清除Apache+Mysql+PHP
- *LeetCode-Remove Linked List Elements
- cf#320 Div.2 Problem D "Or" Game
- CSS样式小总结