Submission #1115120

---

Source Code Expand

#include <bits/stdc++.h>

using namespace std;
#define forn(i, n) for (int i = 0; i < n; i++)
#define re return
#define mp make_pair
#define se second
#define sz(a) (int)a.size()
typedef long long ll;

const ll mod = 1e9 + 7;
ll n, m;
int main() {
	iostream::sync_with_stdio(0);
	//freopen("a.in", "r", stdin);
	cin >> n >> m;
	if (n > m / 2LL) {
		n = m /2LL;
	}	
	//cout << n << " " << m << "\n"
	cout << n + (m - 2LL * n) / 4LL;
}	

Submission Info

Judge Result