SCU - 4440 Rectangle 【】

E - Rectangle

  SCU - 4440 

在长为n，宽为m的矩形上，长为i，宽为j的矩阵个数为

(n-i+1)x(m-j+1)

记num=k/2-i (num>0)  k为周长  i为长  num为宽 
①num<=m时 
num=1,2,3,…,num 
ans=(n-i+1)x(m-1+1)+(n-i+1)x(m-2+1)+…+(n-i+1)*(m-num+1); 
提取(n-i+1),就是一个等差数列 
ans+=(n-i+1)x(2m-num+1)num/2; 

②num>m时 

num=1,2,3,…,m
ans=(n-i+1)x(m-1+1)+(n-i+1)x(m-2+1)+…+(n-i+1)*(m-m+1); 

ans+=(n-i+1)x(m+1)m/2; 

#include<iostream>
#include<cstdio>
#include<cmath>
#include<string>
#include<cstring>
#include<queue>
#include<stack>
#include<vector>
#include<set>
#include<map>
#include<algorithm>
using namespace std;
#define ms(a,b) memset(a,b,sizeof(a))
#define ll long long

const int M=1e6+10;
const int eps=1e-10;

ll n,m,k,ans,num;
int main()
{
  while(~scanf("%lld%lld%lld",&n,&m,&k))
  {
    ans=0;
    for(int i=1;i<=n;i++)
    {
      num=k/2-i;
      if(num<=m&&num>0)ans+=(n-i+1)*(2*m-num+1)*num/2;
      else if(num>0)ans+=(n-i+1)*(1+m)*m/2;
    }
    printf("%lld\n",ans);
  }
  return 0;
}