矩形A + B
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 5334 Accepted Submission(s): 4144
Total Submission(s): 5334 Accepted Submission(s): 4144
Problem Description
给你一个高为n ,宽为m列的网格,计算出这个网格中有多少个矩形,下图为高为2,宽为4的网格.
Input
第一行输入一个t, 表示有t组数据,然后每行输入n,m,分别表示网格的高和宽 ( n < 100 , m < 100).
Output
每行输出网格中有多少个矩形.
Sample Input
2 1 2 2 4
Sample Output
3 30
输入 n,m;
每个橫边有1-n中组合,共(1+n)*n/2种,竖边有1-m种组合,共(1+m)*m/2种!
所以组合的矩形有(1+n)*n*m*(1+m)/4种!
代码!
#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
int y(int x)
{
int s;
s=(1+x)*x/2;
return s;
}
int main()
{
int t;
cin>>t;
while(t--)
{
int n,m,sum,a,b;
cin>>n>>m;
a=y(n);
b=y(m);
sum=a*b;
cout<<sum<<endl;
}
return 0;
}