【codeforces】#621B-Wet Shark and Bishops

点击打开题目

Wet Shark and Bishops

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Today, Wet Shark is given n bishops on a 1000 by 1000 grid. Both rows and columns of the grid are numbered from 1 to 1000. Rows are numbered from top to bottom, while columns are numbered from left to right.

Wet Shark thinks that two bishops attack each other if they share the same diagonal. Note, that this is the only criteria, so two bishops may attack each other (according to Wet Shark) even if there is another bishop located between them. Now Wet Shark wants to count the number of pairs of bishops that attack each other.

Input

The first line of the input contains n (1 ≤ n ≤ 200 000) — the number of bishops.

Each of next n lines contains two space separated integers xi and yi (1 ≤ xi, yi ≤ 1000) — the number of row and the number of column where i-th bishop is positioned. It's guaranteed that no two bishops share the same position.

Output

Output one integer — the number of pairs of bishops which attack each other.

Examples

input

5
1 1
1 5
3 3
5 1
5 5

output

6

input

3
1 1
2 3
3 5

output

0

Note

In the first sample following pairs of bishops attack each other: (1, 3), (1, 5), (2, 3), (2, 4),(3, 4) and (3, 5). Pairs (1, 2), (1, 4), (2, 5) and (4, 5) do not attack each other because they do not share the same diagonal.

题意：1000*1000的格子，象任意放，公对角线可以相互吃

规律：斜向右下的一条x-y都相等，斜向左下的一条x+y都相等，求出线上个数，组个n个去2个，即。

注：相同结果存入一个a[i]，个数为a[i]++,灵活运用，多想~！

#include<cstdio>
int main()
{
	int t,n,m;
	int ans=0;
	int a[2200]={0};
	int b[2200]={0};
	scanf("%d",&t);
	for(int i=1;i<=t;i++)
	{
		scanf("%d%d",&n,&m);
		a[n-m+1000]++;
		b[n+m]++;
	}
	for(int i=1;i<=2000;i++)
	{
		if(a[i]!=0)
			ans+=(a[i]*(a[i]-1)/2);
		if(b[i]!=0)
			ans+=(b[i]*(b[i]-1))/2; 
	} 
	printf("%d\n",ans);
	return 0; 
}