zoukankan      html  css  js  c++  java
  • Codeforces Round #345 (Div. 2) A

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

    Friends are going to play console. They have two joysticks and only one charger for them. Initially first joystick is charged at a1 percent and second one is charged at a2 percent. You can connect charger to a joystick only at the beginning of each minute. In one minute joystick either discharges by 2 percent (if not connected to a charger) or charges by 1 percent (if connected to a charger).

    Game continues while both joysticks have a positive charge. Hence, if at the beginning of minute some joystick is charged by 1 percent, it has to be connected to a charger, otherwise the game stops. If some joystick completely discharges (its charge turns to 0), the game also stops.

    Determine the maximum number of minutes that game can last. It is prohibited to pause the game, i. e. at each moment both joysticks should be enabled. It is allowed for joystick to be charged by more than 100 percent.

    Input

    The first line of the input contains two positive integers a1 and a2 (1 ≤ a1, a2 ≤ 100), the initial charge level of first and second joystick respectively.

    Output

    Output the only integer, the maximum number of minutes that the game can last. Game continues until some joystick is discharged.

    Examples
    input
    3 5
    output
    6
    input
    4 4
    output
    5
    Note

    In the first sample game lasts for 6 minute by using the following algorithm:

    • at the beginning of the first minute connect first joystick to the charger, by the end of this minute first joystick is at 4%, second is at 3%;
    • continue the game without changing charger, by the end of the second minute the first joystick is at 5%, second is at 1%;
    • at the beginning of the third minute connect second joystick to the charger, after this minute the first joystick is at 3%, the second one is at 2%;
    • continue the game without changing charger, by the end of the fourth minute first joystick is at 1%, second one is at 3%;
    • at the beginning of the fifth minute connect first joystick to the charger, after this minute the first joystick is at 2%, the second one is at 1%;
    • at the beginning of the sixth minute connect second joystick to the charger, after this minute the first joystick is at 0%, the second one is at 2%.

    After that the first joystick is completely discharged and the game is stopped.

    第一cf 出三题 进入rank1000

    题意: 两个电池 初始电量为a1 a2 不充电的话每分钟减少2格电 充电的话每分钟增加1格电 当前只有一根充电线 也就是只能给其中一个电池充电

              当其中任意一个电池电量小于等于0时结束 或者都为1时结束  问 这个过程最多能持续多少分钟

    题解: 可以判断 若要这个过程持续 必须使电量大的电池的电量大于等于2 知道这个就很好写了 

     1 #include<bits/stdc++.h>
     2 #include<iostream>
     3 #include<cstdio>
     4 #define ll __int64
     5 using namespace std;
     6 int a,b;
     7 int main()
     8 {
     9      scanf("%d %d",&a,&b);
    10      int maxn=0,jishu=0,t;
    11      maxn=max(a,b);
    12      while(maxn>=2)
    13      {
    14          if(a>b)
    15          {
    16              t=a;
    17              a=b;
    18              b=t;
    19          }
    20          if(a<=0)
    21             break;
    22          a=a+1;
    23          b=b-2;
    24          maxn=max(a,b);
    25          jishu++;
    26      }
    27      printf("%d
    ",jishu);
    28     return 0;
    29 }
  • 相关阅读:
    JS写游戏
    为运算表达式设计优先级
    原子的数量
    二叉搜索树的范围和
    所有可能的满二叉树
    有效的井字游戏
    站在对象模型的尖端
    执行期语意学
    构造、析构、拷贝语意学
    [CSP-S模拟测试]:序列(二分答案+树状数组)
  • 原文地址:https://www.cnblogs.com/hsd-/p/5255107.html
Copyright © 2011-2022 走看看