80分求dalao,最后一个WA(不是TLE)
查看原帖
80分求dalao,最后一个WA(不是TLE)
713955
__er楼主2022/4/27 16:02

WA Code:

#include <bits/stdc++.h>
using namespace std;
int a[1001][3], n, i, j, cnt;

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

2022/4/27 16:02
加载中...