0分救命 案例能跑对
查看原帖
0分救命 案例能跑对
1838222
No_41楼主2025/8/29 23:11
#include<iostream>
using namespace std;
int main() {
    int a[2000][5];
    int n = 0, ans = 0;
    cin >> n;
    for (int i = 1; i <= n; i++) {
        for (int j = 0; j <= 2; j++) {
            cin >> a[i][j];
            a[i][3] += a[i][j];
        }
    }
    for (int i = 1; i <= n; i++) {
        for (int j = i + 1; j <= n; j++) {
            if (abs(a[i][0] - a[j][0]) > 5 || 
                abs(a[i][1] - a[j][1]) > 5 || 
                abs(a[i][2] - a[j][2]) > 5 || 
                abs(a[i][3] - a[j][3]) > 10) break;
            else ans++;
        }
    }
    cout << ans;
    return 0;
}
2025/8/29 23:11
加载中...