ZOJ4037 Peer Review

最新推荐文章于 2022-10-10 18:27:12 发布

原创最新推荐文章于 2022-10-10 18:27:12 发布 · 436 阅读

0 ·

CC 4.0 BY-SA版权

题目同时被 2 个专栏收录

2 篇文章

订阅专栏

水题

1 篇文章

订阅专栏

探讨n名学生在互评课程项目中，如何在确保自身得分最大化的同时，使其他学生的总分最小化。通过分析学生之间的博弈策略，预测最终每位学生的得分情况。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

1.题目

There are n students involved in a peer review about their course projects. Each student has to score the other (n-1) students’ projects separately. The score given must be an integer ranging from 0 to 100 (both inclusive), and the final score of a student is the sum of the scores his project receives.
But these students are on bad terms with each other, so they all want to minimize the sum of the final scores of the other students, and maximize his/her own final score when the first condition is satisfied.
If every student uses the best strategy, can you predict their final scores?

大意：n名学生要互相评分，可以打[0,100]分。每人都想让别人尽可能低分而自己高分。现有多组数据，每组给出人数n，请输出各个学生的得分（他人给自己的评分之和）。

2.答案

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

int main(){
    int T,n;
    scanf("%d",&T);
    while(T--){
        scanf("%d",&n);
        for(int i=1;i<=n;i++){
            printf("0");
            if(i!=n) printf(" ");
        }
        printf("\n");
    }
    return 0;
}