zoukankan      html  css  js  c++  java
  • CF div2 320 A

    A. Raising Bacteria
    time limit per test
    1 second
    memory limit per test
    256 megabytes
    input
    standard input
    output
    standard output

    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 <cstring>
     3 #include <iostream>
     4 #include <queue>
     5 #include <stack>
     6 #include <vector>
     7 #include <algorithm>
     8 
     9 using namespace std;
    10 
    11 const int maxn = 100005;
    12 
    13 typedef long long ll;
    14 
    15 
    16 
    17 int main()
    18 {
    19     long long n;
    20     scanf("%lld",&n);
    21     long long cnt = 1;
    22 
    23     while(n!=1){
    24         if(n%2==0) n/=2;
    25         else {
    26             n--;
    27             cnt++;
    28         }
    29 
    30     }
    31     printf("%d
    ",cnt);
    32 
    33 
    34 
    35 
    36     return 0;
    37 }
    View Code
  • 相关阅读:
    POJ3041Asteroids(最小点覆盖+有点小抽象)
    POJ 2240Arbitrage(Floyd)
    POJ1860Currency Exchange(Bellman + 正权回路)
    POJ3259Wormholes(判断是否存在负回路)
    TCL V7300A-3D升级教程
    “一生所爱“一首一听就很想落泪的歌曲
    一生所爱 怀念那段旧时光~
    文艺小青年
    又是一年中秋节
    luogu1080 国王游戏(贪心+高精度)
  • 原文地址:https://www.cnblogs.com/lmlyzxiao/p/4817987.html
Copyright © 2011-2022 走看看