6541: Ball
内存限制：512 MB
时间限制：4.000 S
评测方式：文本比较
命题人：
提交：8
解决：4
题目描述
Give a chessboard of M∗M , with N point on it. You should calculate how many solutions there ar to select 3 points to make the median distance between the distance between the 3 points is a prime number?
the distance between (x1,y1) and (x2,y2) is |x1−x2|+|y1−y2|
the distance between (x1,y1) and (x2,y2) is |x1−x2|+|y1−y2|
输入
Each test contains multiple test cases. The first line contains the number of test cases T(1≤T≤10). Description of the test cases follows.
The first line of each test case contains two integers N,M
The next N lines each line contains two integers xi,yi
It’s guaranteed there are no i,j(i≠j) satisfies both xi=xj and yi=yj
1≤N≤2000,1≤M≤105,1≤xi,yi≤M
The first line of each test case contains two integers N,M
The next N lines each line contains two integers xi,yi
It’s guaranteed there are no i,j(i≠j) satisfies both xi=xj and yi=yj
1≤N≤2000,1≤M≤105,1≤xi,yi≤M
输出
For each test case, print one integer — the answer to the problem.
样例输入 复制
2
3 3
1 1
2 2
3 3
3 3
1 1
2 1
3 2样例输出 复制
1
1