P2241 统计方形（数据加强版）

https://www.luogu.org/problem/P2241

思路：矩形数=正方形+长方形；

矩形数：左边任取两点组成线段，上面任取两点组成线段，两条线段组成一个矩形；即C(n+1,2)*C(m+1,2);

正方形：画图数一下发现就是(n-i+1)*(m-i+1)（1<=i<=min(n,m)）;展开再利用平方和公式

（     1^2+2^2+3^3.....=(n)*(n+1)* (2*n+1)/6）;

#include <iostream>
#include <cstring>
#include <queue>
#include <vector>
#include <algorithm>
#include <cstdio>
#include <set>
#include <map>
#include <cmath>
//#include<bits/stdc++.h>
using namespace std;

#define sfi(i) scanf("%d",&i)
#define sfl(i) scanf("%I64d",&i)
#define sfs(i) scanf("%s",(i))
#define pri(i) printf("%d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define eps 1e-10
#define PI acos(-1.0)
#define lowbit(x) ((x)&(-x))
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define lson (rt<<1)
#define rson (rt<<1|1)
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)

const int N=1e6+9;
const int M=4e5+9;

bool vis[N];
int prime[N];
int cnt=0;
void P()
{
    vis[1]=1;
    for(int i=2;i<N;i++)
    {
        if(!vis[i])
        {
            prime[cnt++]=i;
            for(int j=i+i;j<N;j+=i) vis[j]=1;
        }
    }
}

int main()
{
    //FAST_IO;
    //freopen("input.txt","r",stdin);

    ll n,m;
    cin>>n>>m;

    ll Min=min(n,m);
    ll sum=n*(n+1)/2;
    sum=sum*m*(m+1)/2;
    //cout<<sum<<endl;

    ll sig=Min*(Min+1)/2;
    //cout<<sig<<endl;

    ll pf2=Min*(Min+1)*(Min*2+1)/6;
    //cout<<pf2<<endl;

    ll sumz=Min*(n*m+n+m+1)-sig*(n+m+2)+pf2;

    cout<<sumz<<" "<<sum-sumz<<endl;

    return 0;
}