A and B and Team Training——求最大组队数

A and B and Team Training

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

A and B are preparing themselves for programming contests.

An important part of preparing for a competition is sharing programming knowledge from the experienced members to those who are just beginning to deal with the contests. Therefore, during the next team training A decided to make teams so that newbies are solving problems together with experienced participants.

A believes that the optimal team of three people should consist of one experienced participant and two newbies. Thus, each experienced participant can share the experience with a large number of people.

However, B believes that the optimal team should have two experienced members plus one newbie. Thus, each newbie can gain more knowledge and experience.

As a result, A and B have decided that all the teams during the training session should belong to one of the two types described above. Furthermore, they agree that the total number of teams should be as much as possible.

There are n experienced members and m newbies on the training session. Can you calculate what maximum number of teams can be formed?

Input

The first line contains two integers n and m (0 ≤ n, m ≤ 5·105) — the number of experienced participants and newbies that are present at the training session.

Output

Print the maximum number of teams that can be formed.

Sample test(s)

input

2 6

output

2

input

4 5

output

3

Note

Let's represent the experienced players as XP and newbies as NB.

In the first test the teams look as follows: (XP, NB, NB), (XP, NB, NB).

In the second test sample the teams look as follows: (XP, NB, NB), (XP, NB, NB), (XP, XP, NB).

题意：有N个A，M个B，组成2个A和1个B，或者两个B一个A，求能够组成的最大的组数。

每次遇到这种题目都自然而然的想到分类讨论，。。。sad。。。但是暴力求解会更加的简单，额额。。。。。。。

#include <iostream>
#include <stdio.h>
#include <string.h>
#include <algorithm>

using namespace std;


int main()
{
    int n,m,i,j,k,num;
    while(~scanf("%d%d",&n,&m))
    {
        num = 0;
        while((n>=2&&m>=1)||(n>=1&&m>=2))//每次都取小的数出一个值，大的数出两个值。
        {
            num++;
            if(n < m)
            {
                n = n - 1;
                m = m - 2;
            }
            else
            {
                n = n - 2;
                m = m - 1;
            }
        }
        printf("%d\n",num);
    }
    return 0;
}