Submission #123286

---

Source Code Expand

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

namespace TaskD
{
    class Program
    {
        const long Mod = 1000000007;

        static void Main(string[] args)
        {
            var input = Console.ReadLine();
            var R = input.Split(' ')[0].Apply(int.Parse);
            var C = input.Split(' ')[1].Apply(int.Parse);
            input = Console.ReadLine();
            var X = input.Split(' ')[0].Apply(int.Parse);
            var Y = input.Split(' ')[1].Apply(int.Parse);
            input = Console.ReadLine();
            var D = input.Split(' ')[0].Apply(int.Parse);
            var L = input.Split(' ')[1].Apply(int.Parse);

            long result = 1;

            //全体
            result = Case(X, Y, D, L);
            //1辺アキ
            result -= Case(X - 1, Y, D, L)*2;
            result -= Case(X, Y - 1, D, L) * 2;
            //1辺アキ*2
            result += Case(X - 1, Y - 1, D, L) * 4;
            result += Case(X - 2, Y, D, L);
            result += Case(X, Y - 2, D, L);
            //*3
            result -= Case(X - 2, Y - 1, D, L) * 2;
            result -= Case(X - 1, Y - 2, D, L) * 2;
            //*4
            result += Case(X - 2, Y - 2, D, L);

            result = Mul(result % Mod, Mul(R - X + 1, C - Y + 1));
            result = result < 0 ? result + Mod : result;

            Console.WriteLine(result);
        }

        static long Case(int x, int y, int d, int l)
        {
            if (x <= 0 || y <= 0)
                return 0;

            long result = 1;

            for (int i = (x*y)-(d+l)+ 1; i <= x*y; i++)
            {
                result = Mul(result,i);
            }

            for (int i = 2; i <= l; i++)
            {
                result = Div(result, i);
            }

            for (int i = 2; i <= d; i++)
            {
                result = Div(result, i);
            }

            return result;
        }

        static long Combi(long n, long r)
        {
            long result = 1;
            for (long i = n - r + 1; i <= n; i++)
            {
                result = Mul(result, i);
            }

            for (long i = 2; i <= r; i++)
            {
                result = Div(result, i);
            }

            return result;
        }

        static long Pow(long x, long y)
        {
            long result = 1;

            while (y>0)
            {
                result = (y % 2 == 0) ? result : ((result * x) % Mod);
                x = (x *x) % Mod;
                y >>= 1;
            }

            return result;
        }

        static long Mul(long x, long y)
        {
            return (x * y) % Mod;
        }

        static long Div(long x, long y)
        {
            return (x * Pow(y, Mod - 2)) % Mod;
        }
    }

    public static class Ex
    {
        public static TResult Apply<T, TResult>(this T arg, Func<T, TResult> func)
        {
            return func(arg);
        }
    }
}

Submission Info

Judge Result