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

做题地址：https://www.luogu.com.cn/problem/P5728

---

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>

using namespace std;

const int N = 100010;

int n;
int a[N][6];

int main() {
    cin >> n;
    for (int i = 0; i < n; i ++ ) {
        cin >> a[i][0] >> a[i][1] >> a[i][2];
        a[i][3] = a[i][0] + a[i][1] + a[i][2];
    }    
    
    int cnt = 0;
    for (int i = 0; i < n; i ++ ) {
        for (int j = i + 1; j < n; j ++ ){
            int x = abs(a[i][0] - a[j][0]);
            int y = abs(a[i][1] - a[j][1]);
            int z = abs(a[i][2] - a[j][2]);
            int t = abs(a[i][3] - a[j][3]);
            
            if (x <= 5 && y <= 5 && z <= 5 && t <= 10) cnt ++;
        }
    }
    
    cout << cnt << endl;
    
    return 0;
}