#include<iostream>
#include<cstdio>
#include<deque>
#include<cstring>
#include<cmath>
using namespace std;
struct Node{
int Chinese,Math,English;
int total;
};
int main(){
int n;
scanf("%d",&n);
Node obj[n];
for(int i=0;i<n;i++){
scanf("%d%d%d",&obj[i].Chinese,&obj[i].Math,&obj[i].English);
obj[i].total=0;
obj[i].total=obj[i].Chinese+obj[i].Math+obj[i].English;
}
int count=0;
for(int i=0;i<n-1;i++)
for(int j=i+1;j<n;j++){
if(abs(obj[i].Chinese-obj[j].Chinese)<=5&&abs(obj[i].Math-obj[j].Math)<=5&&abs(obj[i].English-obj[j].English)<=5&&abs(obj[i].total-obj[j].total)<=10)
count++;
}
printf("%d\n",count);
return 0;
}
P5728 【深基5.例5】旗鼓相当的对手
最新推荐文章于 2024-06-06 23:12:34 发布