#include<iostream>
#include<cmath>
using namespace std;
int s[1001][4],tot;
int main()
{
int n;cin >> n;
for(int i = 1;i <= n;i++)
{
cin >> s[i][0] >> s[i][1]>>s[i][2];
s[i][3] = s[i][0]+s[i][1]+s[i][2];
}
for(int i = 1;i < n;i++)
for(int j = i+1;j <= n;j++)
{
if(abs(s[j][0]-s[i][0])<=5&&abs(s[j][1]-s[i][1])<=5&&abs(s[j][2]-s[i][2])<=5&&abs(s[j][3]-s[i][3])<=10)
tot++;
}
cout << tot;
}
大佬
结构体
#include<iostream>
#include<cmath>
using namespace std;
int n,ans=0;
struct p{
int a,b,c;
}q[1010];
int main(){
cin>>n;
for(int i=1;i<=n;i++){
cin>>q[i].a>>q[i].b>>q[i].c;
}
for(int i=1;i<n;i++){
for(int j=i+1;j<=n;j++){
if(abs(q[i].a-q[j].a)<=5&&abs(q[i].b-q[j].b)<=5&&abs(q[i].c-q[j].c)<=5&&
abs(q[i].a+q[i].b+q[i].c-(q[j].a+q[j].b+q[j].c))<=10){
ans++;
}
}
}
cout<<ans<<endl;
return 0;
}