1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
#include <iostream>
#include <cstdio>

using namespace std;

int x[250005];
int y[250005];
int X[250005];
int Y[250005];

int n;
long long result;

int main ()
{
	scanf("%d", &n);
	for (int i = 0; i < n; ++i) scanf("%d%d", &x[i], &y[i]);
	for (int i = 0; i < n; ++i)
	{
		for (int j = 0; j < n; ++j)
		{
			X[j] = x[j];
			Y[j] = y[j];
		}
		for (int j = 0; j < n; ++j) if (i != j)
		{
			for (int k = 0; k < n; ++k) if (k != i)
			{
				if (X[j] < X[k]) X[k]--;
				else if (X[j] > X[k]) X[k]++;
				if (Y[j] < Y[k]) Y[k]--;
				else if (Y[j] > Y[k]) Y[k]++;
			}
		}
		result = 0;
		for (int j = 0; j < n; ++j) result += (long long)(X[j]) * (long long)(Y[j]);
		printf("%lld\n", result);
	}
	return 0;
}