CT - Counting triangles
Tác giả: hieult
Ngôn ngữ: C++
#include <cstdio>
//#include <conio.h>
int min(int a,int b)
{
if(a<b) return a;
return b;
}
int main()
{
int test,n,m;
long long KQ;
scanf("%d",&test);
for(int ii = 1;ii<=test;ii++)
{
scanf("%d %d",&n,&m);
KQ = 0;int a,b;
for(int i = 0;i<=n;i++)
for(int j = 0;j<=m;j++)
{
a = min(j,i);b = min(i,m-j); KQ = KQ+(a+1)*b;
a = min(i,m-j);b = min(m-j,n-i); KQ = KQ+(a+1)*b;
a = min(m-j,n-i);b = min(n-i,j); KQ = KQ+(a+1)*b;
a = min(n-i,j);b = min(i,j); KQ = KQ+(a+1)*b;
}
printf("%lld\n",KQ);
}
// getch();
}