Compute‘s Matrix

題目:

#include <bits/stdc++.h>
using namespace std;
long long mod=1e9+7;
int main()
{
    int t;
    cin>>t;
    while(t--)
    {
        long long ans=0;
        long long n,x1,y1,x2,y2;
        cin>>n>>x1>>y1>>x2>>y2;
        for(long long i=x1;i<=x2;i++)
        {
            long long a=i*y1%mod;
            long long s=((y2-y1+1)*a)%mod;
            long long x,y;
            if((y2-y1)%2==0)
            {
                x=(((y2-y1)/2)*i)%mod;
                y=(y2-y1+1);
            }
            else
            {
                x=((y2-y1)*i)%mod;
                y=(y2-y1+1)/2;
            }
            long long z=(x*y)%mod;
            ans=((ans+s)%mod+z)%mod;
            //cout<<s<<" "<<x<<" "<<ans<<endl;
        }
        cout<<ans<<endl;
    }
    return 0;
}