# Codeforces Round #341 (Div. 2)B. Wet Shark and Bishops

163人阅读 评论(0)

#include<bits\stdc++.h>
using namespace std;
int cnt1[10005];
int cnt2[10005];
int main()
{
int n;
int ans = 0;
cin >>n;
for(int i = 1;i<=n;i++)
{
int x,y;
scanf("%d%d",&x,&y);
cnt1[x+y]++;
cnt2[x-y+1000]++;
}
for(int i = 0;i<=2005;i++)
{
ans+=cnt1[i]*(cnt1[i]-1)/2;
ans+=cnt2[i]*(cnt2[i]-1)/2;
}
cout << ans << endl;
}


B. 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.

0
0

* 以上用户言论只代表其个人观点，不代表CSDN网站的观点或立场
个人资料
• 访问：315234次
• 积分：13429
• 等级：
• 排名：第1130名
• 原创：1078篇
• 转载：3篇
• 译文：0篇
• 评论：49条
阅读排行
最新评论