zoukankan      html  css  js  c++  java
  • CodeForces 651A(水题)

    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.

    Sample Input

    Input
    3 5
    Output
    6
    Input
    4 4
    Output
    5

    题意 两个游戏机,每分钟充电电量加1,不充电量减2,只能给一台游戏机充电(可交换),当其中一台电量为0则停在,求持续的分钟数
     1 #include<iostream>
     2 #include<cstdio>
     3 using namespace std;
     4 int main()
     5 {
     6     int a1,a2;
     7     while(cin>>a1>>a2)
     8     {
     9         if(a1<a2)
    10         {
    11             a2=a1+a2;
    12             a1=a2-a1;
    13             a2=a2-a1;
    14         }
    15         if(a1==1&&a2==1)
    16             cout<<0<<endl;
    17         int t=0;
    18         while(a1>0&&a2>0)
    19         {
    20             if(a2>a1)
    21             {
    22                 a2=a2-2;
    23                 a1=a1+1;
    24             }
    25             else
    26             {
    27                 a1=a1-2;
    28                 a2=a2+1;
    29             }
    30             t++;
    31         }
    32         cout<<t<<endl;
    33     }
    34     return 0;
    35 }
  • 相关阅读:
    PHP 的 序列化与反序列化 自己的理解
    通达OA 11.6 rce漏洞复现
    MySQL 表字段唯一性约束设置方法unique
    HTTP响应状态码
    PHP 魔术变量
    PHP匿名函数使用技巧
    PHP 三大结构
    PHP unset()函数销毁变量
    算法第五章作业
    算法第四章作业
  • 原文地址:https://www.cnblogs.com/Aa1039510121/p/5687890.html
Copyright © 2011-2022 走看看