数数有多少个矩形

矩形的个数
#include <bits/stdc++.h>
using namespace std;
int mp[1010][1010];
int main()
{
for(int i = 0; i < 110; i++)
{
mp[0][i] = i+1;
mp[i][0] = i+1;
}
mp[1][1] = 1;
for(int i = 2; i <= 110; i++)
{
mp[1][i] = mp[i][1] = mp[i-1][1]+i;
}
for(int i = 2; i <= 110; i++)
{
for(int j = 2; j <= 110; j++)
mp[i][j] = mp[j][i] = mp[i][1]*mp[1][j];
}
int k, n, m;
cin >> k;
while(k --)
{
cin >> n >> m;
cout << mp
[m] << endl;
}
return 0;
}