Submission #1518399

---

Source Code Expand

#include<bits/stdc++.h>

using namespace std;
typedef long long ll;
const ll inf = 1e9;

ll n, m, ans = inf;

int main() {
    cin >> n >> m;
    for(ll i = 1; i <= n; ++i) {
        ll Mx1 = ceil(float(m)/2)*(n-i), Mn1 = (m/2)*(n-i);
        ll Mx = max(i*m, Mx1), Mn = min(i*m, Mn1);
        ans = min(ans, Mx - Mn);
        Mx1 = ceil(float(n-i)/2)*m, Mn1 = (n-i)/2*m;
        Mx = max(i*m, Mx1), Mn = min(i*m, Mn1);
        ans = min(ans, Mx - Mn);
    }
    for(ll i = 1; i <= m; ++i) {
        ll Mx1 = ceil(float(n)/2)*(m-i), Mn1 = (n/2)*(m-i);
        ll Mx = max(i*n, Mx1), Mn = min(i*n, Mn1);
        ans = min(ans, Mx - Mn);
        Mx1 = ceil(float(m-i)/2)*n, Mn1 = (m-i)/2*n;
        Mx = max(i*n, Mx1), Mn = min(i*n, Mn1);
        ans = min(ans, Mx - Mn);
    }
    cout << ans;
}

Submission Info

Judge Result