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

    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.

     1 #include <bits/stdc++.h>
     2 using namespace std;
     3 int main()
     4 {
     5     int n,m;
     6     scanf("%d%d",&n,&m);
     7     int ans=0;
     8     while(n>0&&m>0)
     9     {
    10         if(n==1&&m==1)break;
    11         if(n>m)
    12         {
    13             int a=n;
    14             n=m;
    15             m=a;
    16         }
    17         n+=1;
    18         m-=2;
    19         ans++;
    20     }
    21     printf("%d
    ",ans);
    22     return 0;
    23 }
  • 相关阅读:
    min-max 容斥
    集训作业
    UOJ Test Round 3
    uoj Goodbye Dingyou
    Codeforces Round #516 (Div. 1) 题解
    Codeforces Round #517(Div. 1) 题解
    概率论(Ⅱ)
    Berlekamp-Massey算法学习笔记
    多项式取模优化线性递推总结
    [ZJOI2019]线段树
  • 原文地址:https://www.cnblogs.com/z-712/p/7323557.html
Copyright © 2011-2022 走看看