矩形A + B
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 7792 Accepted Submission(s): 5930
Problem Description
给你一个高为n ,宽为m列的网格,计算出这个网格中有多少个矩形,下图为高为2,宽为4的网格.
![](https://i-blog.csdnimg.cn/blog_migrate/30eb0263b48b7de077ccf5a73574b88d.jpeg)
Input
第一行输入一个t, 表示有t组数据,然后每行输入n,m,分别表示网格的高和宽 ( n < 100 , m < 100).
Output
每行输出网格中有多少个矩形.
Sample Input
2 1 2 2 4
Sample Output
3 30
Source
代码:
#include<stdio.h>
#include<string.h>
int main()
{
int T;
while(scanf("%d",&T)!=EOF)
{
int n,m;
while(T--)
{
scanf("%d %d",&n,&m);
int k1=(1+n)*n/2;
int k2= (1+m)*m/2;
int ans=k1*k2;
printf("%d\n",ans);
}
}
return 0;
}
#include<stdio.h>
#include<string.h>
int main()
{
int T;
while(scanf("%d",&T)!=EOF)
{
int n,m;
while(T--)
{
scanf("%d %d",&n,&m);
int k1=(1+n)*n/2;
int k2= (1+m)*m/2;
int ans=k1*k2;
printf("%d\n",ans);
}
}
return 0;
}