Submission #1370032

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

#define rep(i,a,n) for(int (i)=(a);(i)<(int)(n);(i)++)
#define foreach(c,itr) for(__typeof((c).begin()) itr=(c).begin();itr!=(c).end();itr++)
#define SZ(x) ((int) (x).size())
typedef long long ll;

const int MOD = (int)1e9 + 7;
int main() {
    long long n, m;
    while(cin >> n >> m) {
        if(2*n >= m)  cout << n << endl;
        else cout << (m - 2*n) / 4 + n << endl;
    }
    return 0;
}

Submission Info

Judge Result