zoukankan      html  css  js  c++  java
  • codeforces 651A

    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.

    第一行输入两个数n和m,每分钟不连接充电器电量掉2,连充电器电量增加1,如果开始都为1则游戏不能进行,求最大的游戏进行时间,可以直接模拟这个过程进行运算。

    #include<iostream>
    using namespace std;
    int main()
    {
        int n, m, minute = 0;
        cin >> n >> m;
        if (n == 1 && m == 1)
        {
            cout << '0' << endl;
            return 0;
        }
        while (n != 0 && m != 0)
        {
            if (n > m)
            {
                n -= 2;
                m += 1;
                minute++;
            }
            else
            {
                m -= 2;
                n += 1;
                minute++;
            }
        }
        cout << minute << endl;
        return 0;
    }
  • 相关阅读:
    算法沉思录之算法的结构
    OSSpinLockLock加锁机制,保证线程安全并且性能高
    iOS 开源库系列 Aspects核心源码分析---面向切面编程之疯狂的 Aspects
    代码阅读沉思录:代码的灵、肉与骨
    iOS AOP框架Aspects实现原理
    最近还是太浮躁了,一周阅读一个开源库是值得的
    performSelector 多参调用的实现方案
    oc消息转发:forwardInvocation、签名、参量个数、SEL 相关测试
    isa class superclass metaclass
    ARC与Toll-Free Bridging
  • 原文地址:https://www.cnblogs.com/chenruijiang/p/8259453.html
Copyright © 2011-2022 走看看