Problem:
Score : 400 points

Problem Statement

There is a bar of chocolate with a height of H blocks and a width of W blocks.
Snuke is dividing this bar into exactly three pieces.
He can only cut the bar along borders of blocks, and the shape of each piece must be a rectangle.

Snuke is trying to divide the bar as evenly as possible.
More specifically, he is trying to minimize S_{max} - S_{min}, where S_{max} is the area (the number of blocks contained) of the largest piece, and S_{min} is the area of the smallest piece.
Find the minimum possible value of S_{max} - S_{min}.

Constraints

2 ≤ H, W ≤ 10^5

Input

Input is given from Standard Input in the following format:

H W

Output

Print the minimum possible value of S_{max} - S_{min}.

Sample Input 1

3 5

Sample Output 1

0

In the division below, S_{max} - S_{min} = 5 - 5 = 0.

Sample Input 2

4 5

Sample Output 2

2

In the division below, S_{max} - S_{min} = 8 - 6 = 2.

Sample Input 3

5 5

Sample Output 3

4

In the division below, S_{max} - S_{min} = 10 - 6 = 4.

Sample Input 4

100000 2

Sample Output 4

1

Sample Input 5

100000 100000

Sample Output 5

50000

Solution in C# (Mono 4.6.2.0) (judge verdict: Wrong Answer)

using System;
using System.Collections;
using System.Collections.Generic;
using System.Diagnostics;
using System.IO;
using System.Linq;
using System.Text;
namespace AtCoder {
    class MainClass {
        //C#7.0
        long H, W;
        void Solve() {

            io.i(out H, out W);

            long ans = long.MaxValue;

            if (H % 3 == 0 || W % 3 == 0) {
                ans = 0;
            } else {
                for (long i = 1; i < H; i++) {
                    long tmp = diff(H, W, i);
                    if (ans > tmp) ans = tmp;
                }
                for (long i = 1; i < W; i++) {
                    long tmp = diff(W, H, i);
                    if (ans > tmp) ans = tmp;
                }
            }

            io.o(ans);

        }

        long diff(long e1, long e2, long i) {
            long e = e2 / 2;
            long s1 = e2 * i;
            long s2 = (e1 - i) * e;
            long s3 = (e1 - i) * (e2 - e);
            return max(s1, s2, s3) - min(s1, s2, s3);
        }

        long min(params long[] a) {
            return a.Min();
        }
        long max(params long[] a) {
            return a.Max();
        }

        public static void Main(string[] args) { new MainClass().Stream(); }
        IO io = new IO();
        void Stream() { Solve(); io.writeFlush(); }

        class IO {
            string[] nextBuffer; int BufferCnt; char[] cs = new char[] { ' ' };
            StreamWriter sw = new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false };
            public IO() { nextBuffer = new string[0]; BufferCnt = 0; Console.SetOut(sw); }
            public string next() {
                if (BufferCnt < nextBuffer.Length) return nextBuffer[BufferCnt++];
                string st = Console.ReadLine();
                while (st == "") st = Console.ReadLine();
                nextBuffer = st.Split(cs, StringSplitOptions.RemoveEmptyEntries);
                BufferCnt = 0;
                return nextBuffer[BufferCnt++];
            }
            public char nextChar() { return char.Parse(next()); }
            public int nextInt() { return int.Parse(next()); }
            public long nextLong() { return long.Parse(next()); }
            public double nextDouble() { return double.Parse(next()); }
            public string[] array() { return Console.ReadLine().Split(' '); }
            public char[] arrayChar() { return Array.ConvertAll(array(), char.Parse); }
            public int[] arrayInt() { return Array.ConvertAll(array(), int.Parse); }
            public long[] arrayLong() { return Array.ConvertAll(array(), long.Parse); }
            public double[] arrayDouble() { return Array.ConvertAll(array(), double.Parse); }
            private bool typeEQ<T, U>() { return typeof(T).Equals(typeof(U)); }
            private T convertType<T, U>(U v) { return (T)Convert.ChangeType(v, typeof(T)); }
            private T suitType<T>(string s) {
                if (typeEQ<T, int>()) return convertType<T, int>(int.Parse(s));
                if (typeEQ<T, long>()) return convertType<T, long>(long.Parse(s));
                if (typeEQ<T, double>()) return convertType<T, double>(double.Parse(s));
                if (typeEQ<T, char>()) return convertType<T, char>(char.Parse(s));
                return convertType<T, string>(s);
            }
            public void i<T>(out T v) { v = suitType<T>(next()); }
            public void i<T, U>(out T v1, out U v2) {
                var a = array(); v1 = suitType<T>(a[0]); v2 = suitType<U>(a[1]);
            }
            public void i<T, U, V>(out T v1, out U v2, out V v3) {
                var a = array(); v1 = suitType<T>(a[0]); v2 = suitType<U>(a[1]);
                v3 = suitType<V>(a[2]);
            }
            public void i<T, U, V, W>(out T v1, out U v2, out V v3, out W v4) {
                var a = array(); v1 = suitType<T>(a[0]); v2 = suitType<U>(a[1]);
                v3 = suitType<V>(a[2]); v4 = suitType<W>(a[3]);
            }
            public void ini(out int[] a, int size) {
                a = new int[size]; for (int i = 0; i < size; i++) a[i] = nextInt();
            }
            public void ini(out int[] a1, out int[] a2, int size) {
                a1 = new int[size]; a2 = new int[size];
                for (int i = 0; i < size; i++) { a1[i] = nextInt(); a2[i] = nextInt(); }
            }
            public void ini(out string[] a, int size) {
                a = new string[size]; for (int i = 0; i < size; i++) a[i] = next();
            }
            public void inii(out int[] a, int size) {
                a = new int[size]; for (int i = 0; i < size; i++) a[i] = nextInt() - 1;
            }
            public void inii(out int[] a1, out int[] a2, int size) {
                a1 = new int[size]; a2 = new int[size];
                for (int i = 0; i < size; i++) { a1[i] = nextInt() - 1; a2[i] = nextInt() - 1; }
            }
            public void o<T>(T v) { Console.WriteLine(v); }
            public void o<T>(params T[] a) { foreach (T v in a) Console.WriteLine(v); }
            public void o<T>(List<T> l) { foreach (T v in l) sw.WriteLine(v); }
            public void ol<T>(T v) { Console.Write(v + " "); }
            public void ol<T>(params T[] a) { foreach (T v in a) Console.Write(v + " "); Console.WriteLine(""); }
            public void YN(bool f) { Console.WriteLine(f ? "YES" : "NO"); }
            public void Yn(bool f) { Console.WriteLine(f ? "Yes" : "No"); }
            public void yn(bool f) { Console.WriteLine(f ? "yes" : "no"); }
            public void writeFlush() { Console.Out.Flush(); }
        }

        class Mathf {
            public int mod = 1000000007;//10^9+7
            public long Pow(long a, long b) {
                if (b == 0) return 1;
                if (b % 2 == 1) return (a % mod * Pow(a % mod, b - 1) % mod) % mod;
                else return Pow(a * a % mod, b / 2) % mod;
            }
            public long Fact(long n) { return n != 0 ? (n % mod * (Fact(n - 1) % mod) % mod) : 1; }
            public long C(long n, long r) {
                if (r == 0 || n == r) return 1;
                else return (Fact(n) % mod * Pow((Fact(n - r) % mod * Fact(r) % mod) % mod, mod - 2) % mod) % mod;
            }
            public long Sum(params long[] a) { return a.Aggregate((v, next) => (v % mod + next) % mod); }
            public int GCD(int a, int b) { if (a < b) Swap(ref a, ref b); return b == 0 ? a : GCD(b, a % b); }
            public int GCD(int[] array) { return array.Aggregate((v, next) => GCD(v, next)); }
            public void Swap<T>(ref T a, ref T b) { T tmp = a; a = b; b = tmp; }
            public T Max<T>(params T[] v) { return v.Max(); }
            public T Min<T>(params T[] v) { return v.Min(); }
            public double Dis(int x1, int y1, int x2, int y2) {
                return Math.Sqrt(Math.Pow((x2 - x1), 2) + Math.Pow((y2 - y1), 2));
            }
        }
    }

    static class StringEX {
        public static string Reversed(this string s) { return string.Join("", s.Reverse()); }
        public static string Repeat(this string s, int n) { return string.Concat(Enumerable.Repeat(s, n).ToArray()); }
    }
}