zoukankan      html  css  js  c++  java
  • codeforces 579A Raising Bacteria

    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.

     1 #include<cstdio>
     2 #include<cstdlib>
     3 #include<algorithm>
     4 using namespace std;
     5 int main()
     6 {
     7     int x,ans=1;
     8     scanf("%d",&x);
     9     while(x!=1)
    10     {
    11         if(x&1)ans++;
    12         x>>=1;
    13     }
    14     printf("%d
    ",ans);
    15     return 0;
    16 }
  • 相关阅读:
    BZOJ2809: [Apio2012]dispatching
    BZOJ1455: 罗马游戏
    可并堆试水--BZOJ1367: [Baltic2004]sequence
    可并堆模板
    Codeforces870F. Paths
    Codeforces913F. Strongly Connected Tournament
    一练Splay之维修数列第一次
    Codeforces913E. Logical Expression
    Codeforces700C. Break Up
    可持久化KMP
  • 原文地址:https://www.cnblogs.com/homura/p/4988058.html
Copyright © 2011-2022 走看看