Submission #123646

---

Source Code Expand

using System;
using System.Linq;
using System.Collections.Generic;

class Program
{
    static readonly int Mod = 1000000007;

    static void Main(string[] args)
    {
        long H = Read.NextLong(), W = Read.NextLong();
        long Y = Read.NextLong(), X = Read.NextLong();
        long A = Read.NextLong(), B = Read.NextLong();
        long[,] C = ModC(900, Mod);

        long ans = C[Y * X, A] % Mod * C[Y * X - A, B] % Mod;
        for (int dy = 0; dy <= 2; dy++)
            for (int dx = 0; dx <= 2; dx++)
            {
                if (dx + dy == 0) continue;
                long y = Y - dy, x = X - dx;
                if (y <= 0 || x <= 0 || y * x < A + B) continue;
                int sign = (dy + dx) % 2 == 1 ? -1 : 1;
                long count = C[2, dy] * C[2, dx] * C[y * x, A] % Mod * C[y * x - A, B] % Mod;
                ans = ((ans + count * sign) % Mod + Mod) % Mod;
            }

        ans = ans * (H - Y + 1) * (W - X + 1) % Mod;
        Console.WriteLine(ans);
        Console.ReadLine();
    }
    
    static long[,] ModC(int n, int mod)
    {
        long[,] c = new long[n + 1, n + 1];
        for (int i = 0; i <= n; i++)
        {
            c[i, 0] = c[i, i] = 1;
            for (int j = 1; j < i; j++)
                c[i, j] = (c[i - 1, j] + c[i - 1, j - 1]) % mod;
        }
        return c;
    }

    static class Read
    {
        private static Queue<string> que = new Queue<string>();
        public static string Next() { return Dequeue(); }
        public static int NextInt() { return int.Parse(Dequeue()); }
        public static long NextLong() { return long.Parse(Dequeue()); }
        public static double NextDouble() { return double.Parse(Dequeue()); }
        private static string Dequeue()
        {
            if (que.Count == 0) foreach (var s in Console.ReadLine().Split()) que.Enqueue(s);
            return que.Dequeue();
        }
    }
}

Submission Info

Judge Result