995
查看原帖
995
1423431
Mr_p楼主2025/1/27 16:00

#include #include using namespace std;

int main() { int N; cin >> N; // 输入同学数量 vector<vector> scores(N, vector(3)); // 存储同学的成绩

// 输入每个同学的成绩
for (int i = 0; i < N; i++) {
    cin >> scores[i][0] >> scores[i][1] >> scores[i][2];
}

int count = 0; // 统计“旗鼓相当的对手”对数

// 使用双重循环比较每一对学生
for (int i = 0; i < N; i++) {
    for (int j = i + 1; j < N; j++) {
        // 计算每一科的成绩差
        int diff1 = abs(scores[i][0] - scores[j][0]);
        int diff2 = abs(scores[i][1] - scores[j][1]);
        int diff3 = abs(scores[i][2] - scores[j][2]);

        // 计算总分差
        int totalScore1 = scores[i][0] + scores[i][1] + scores[i][2];
        int totalScore2 = scores[j][0] + scores[j][1] + scores[j][2];
        int totalDiff = abs(totalScore1 - totalScore2);

        // 检查条件
        if (diff1 <= 5 && diff2 <= 5 && diff3 <= 5 && totalDiff <= 10) {
            count++; // 符合条件,增加计数
        }
    }
}

cout << count << endl; // 输出“旗鼓相当的对手”对数
return 0;

}

#include <iostream>
#include <vector>
using namespace std;

int main() {
    int N;
    cin >> N; // 输入同学数量
    vector<vector<int>> scores(N, vector<int>(3)); // 存储同学的成绩

    // 输入每个同学的成绩
    for (int i = 0; i < N; i++) {
        cin >> scores[i][0] >> scores[i][1] >> scores[i][2];
    }

    int count = 0; // 统计“旗鼓相当的对手”对数

    // 使用双重循环比较每一对学生
    for (int i = 0; i < N; i++) {
        for (int j = i + 1; j < N; j++) {
            // 计算每一科的成绩差
            int diff1 = abs(scores[i][0] - scores[j][0]);
            int diff2 = abs(scores[i][1] - scores[j][1]);
            int diff3 = abs(scores[i][2] - scores[j][2]);

            // 计算总分差
            int totalScore1 = scores[i][0] + scores[i][1] + scores[i][2];
            int totalScore2 = scores[j][0] + scores[j][1] + scores[j][2];
            int totalDiff = abs(totalScore1 - totalScore2);

            // 检查条件
            if (diff1 <= 5 && diff2 <= 5 && diff3 <= 5 && totalDiff <= 10) {
                count++; // 符合条件,增加计数
            }
        }
    }

    cout << count << endl; // 输出“旗鼓相当的对手”对数
    return 0;
}
2025/1/27 16:00
加载中...