贪心A
来源:互联网 发布:数据库的设计问题 编辑:程序博客网 时间:2024/06/16 18:27
A - 贪心A
Submit
Problem Description
Friends are going to play console. They have two joysticks and only one charger for them. Initially first joystick is charged ata1 percent and second one is charged ata2 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 bymore than 100 percent.
Input
The first line of the input contains two positive integers a1 anda2 (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.
Example
3 5
6
4 4
5
Hint
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.
#include<iostream>
using namespace std;
int main()
{
int m,n,t;
while(~scanf("%d%d",&m,&n))
{
t=0;
while(m>0&&n>0)
{
if(m==n&& m==1)
break;
if(m>n)
{
m=m-2;
n=n+1;
}
else
{
m=m+1;
n=n-2;
}
t++;
}
printf("%d\n",t);
}
return 0;
}
- 贪心A
- A. Dragons codeforces+贪心
- CodeForces 288A--贪心
- Codeforces 556A 贪心
- 二分贪心专题A
- A. Rational Resistance----贪心
- A-B Game --贪心
- 贪心问题 A: 看电视
- 【XMUT】贪心专题A
- A Small Shop------贪心算法
- 2054 Color a Tree 贪心
- A公司的烦恼-贪心
- Codeforces 412A Poster(贪心)
- CodeForces 230A Dragons(贪心)
- CodeForces 230A 贪心+排序
- Codeforces 484A Bits(贪心)
- Codeforces 484A - Bits (贪心)
- Codeforces 484A. Bits 贪心
- Openstack Sydney Summit 投票
- LeetCode-66-Plus One(加一操作)
- 容器TerrSet
- 理解泛型
- 用海康威视摄像头做图像处理问题
- 贪心A
- 电脑无法自动获得ip解决办法(dhcp服务无法启动)
- Spring MVC @Autowired和@Resource的区别
- android指定浏览器打开特定网页
- java 后台实现一验证码功能传递前台
- nginx基本配置与参数说明
- ScrollView 嵌套 Recyclerview 滑动冲突
- centos6.5上静默安装oracle11g
- HIbernate的概述