Number of rectangles (N-Brute force solver, table)

Number Rectangle

Description

give you a grid with a height of N and a m column, and calculate how many rectangles are in this grid, a grid with a height of 2 and a width of 4.                        

Input

The first line enters a T, which indicates that there is a T-group of data, and then each line enters N,m, representing the height and width of the grid (N < W, m < 100).                 

Output

the number of rectangles in the output grid per row.                 

Sample Input

2 1 2) 2 4                

Sample Output

3Test Instructions:a n*m grid that calculates how many rectangles are there? Analysis:Math problems. The use of violence, and the way to play the table. To play the table is to find the law and then directly output the answer. the point of the problem is to find the law, a= (N*n+n)/2* (m*m+m)/2. Code:

1#include <cstdio>2#include <iostream>3 using namespacestd;4 5 intn[ -],m[ -];6 7 intMain ()8 {9     intT;Ten     intN,m,a; Onescanf"%d",&t); A      while(t--) -     { -scanf"%d%d",&n,&m); theA= (n*n+n)/2* (M*M+M)/2; -printf"%d\n", a); -     } -     return 0; +}

View Code

Number of rectangles (N-Brute force solver, table)