P5728 【深基5.例5】旗鼓相当的对手

#include<bits/stdc++.h>
using namespace std;

#define maxg 1001

int main() {
	int N,ans=0;
	int grade[maxg][3];
	cin >> N;
	for (int i = 0; i < N; i++) {
		cin >> grade[i][0] >> grade[i][1] >> grade[i][2];
	}
	for (int i = 0; i < N-1; i++) {//外层比n-1次就行
		for (int j = i + 1; j < N; j++) {//从i+1到n-1 保证不会和i相同
			int n1 = abs(grade[i][0] - grade[j][0]);//abs 求绝对值 因为如果这里的差是负数 三个相加会影响n的值
			int n2 = abs(grade[i][1] - grade[j][1]);
			int n3 = abs(grade[i][2] - grade[j][2]);
			int n = abs(grade[i][0]+ grade[i][1] + grade[i][2] - grade[j][0] - grade[j][1]- grade[j][2]);
			if (n1 <= 5 && n2 <= 5 && n3 <= 5 && n <= 10)
				ans++;
		}
	}
	cout << ans << endl;
	system("pause");
	return 0;
}