zoukankan      html  css  js  c++  java
  • Codeforces 651 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.

    题意就是两个游戏手柄充电,只能给其中一个充电,不充电就会每分钟消耗2%,充电的电量增加1%,充电和消耗不同时进行,问最长能持续多久,如果两个电量都是1或者有一个为0就结束了。

    代码:

    #include<bits/stdc++.h>
    using namespace std;
    int main(){
        int n,m,k;
        while(~scanf("%d%d",&n,&m)){
                k=0;
            while(n&&m){
                if(n==1&&m==1) break;
                if(n>m){
                    n-=2;
                    m+=1;
                }
                else{
                    n+=1;
                    m-=2;
                }
                k++;
            }
            printf("%d
    ",k);
        }
        return 0;
    }
     
  • 相关阅读:
    [labuladong算法小抄]如何判断回文链表
    [PHP]json_encode中文JSON_UNESCAPED_UNICODE在php5.3返回null
    [javascript] 使用javascript实现webrtc视频聊天demo
    [Linux] grep查找文本时反斜杠转义问题
    [css] 使用css画文件夹icon和话筒icon
    [Go] 开源客服系统以及多商户客服系统-GOFLY在线客服
    [javascript] vue和elementui中的键盘事件
    Elasticsearch 学习之不停止服务,完成升级重启维护操作
    unassigned_shards一直无法分配
    Jenkins+Gradle实现打包时自定义项
  • 原文地址:https://www.cnblogs.com/ZERO-/p/7107534.html
Copyright © 2011-2022 走看看