hd 2524 矩形A + B

矩形A + B

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 4073    Accepted Submission(s): 3144

Problem Description

给你一个高为n ，宽为m列的网格，计算出这个网格中有多少个矩形，下图为高为2，宽为4的网格.

 

 

Input

第一行输入一个t, 表示有t组数据，然后每行输入n,m,分别表示网格的高和宽 ( n < 100 , m < 100).

 

 

Output

每行输出网格中有多少个矩形.

 

 

Sample Input

21 22 4

 

 

Sample Output

330

 

 

Source

HDU 2008-10 Programming Contest

 

 

Recommend

gaojie   |   We have carefully selected several similar problems for you:  2521 2523 2503 2526 2522 

#include<stdio.h>
int main()
{
    int n,m,t;
    while(scanf("%d%",&t)!=EOF)
    {
     while(t--)
     {
               scanf("%d%d",&n,&m);
               printf("%d\n",(n+1)*n/2*(m+1)*m/2);
               }
                               }
return 0;
    }