首页 > 其他分享 >Average Score

Average Score

时间:2022-11-22 19:02:35浏览次数:39  
标签:integers sumy sumx int double Average Score Bob


 


Average Score

Bob is a freshman in Marjar University. He is clever and diligent. However, he is not good at math, especially in Mathematical Analysis.

After a mid-term exam, Bob was anxious about his grade. He went to the professor asking about the result of the exam. The professor said:

"Too bad! You made me so disappointed."

"Hummm... I am giving lessons to two classes. If you were in the other class, the average scores of both classes will increase."

Now, you are given the scores of all students in the two classes, except for the Bob's. Please calculate the possible range of Bob's score. All scores shall be integers within [0, 100].

Input

There are multiple test cases. The first line of input contains an integer T indicating the number of test cases. For each test case:

The first line contains two integers N (2 <= N <= 50) and M (1 <= M <= 50) indicating the number of students in Bob's class and the number of students in the other class respectively.

The next line contains N - 1 integers A1, A2, .., AN-1 representing the scores of other students in Bob's class.

The last line contains M integers B1, B2, .., BM representing the scores of students in the other class.

<h4< dd="">

Output

For each test case, output two integers representing the minimal possible score and the maximal possible score of Bob.

It is guaranteed that the solution always exists.

<h4< dd="">

Sample Input

2
4 3
5 5 5
4 4 3
6 5
5 5 4 5 3
1 3 2 2 1

<h4< dd="">

Sample Output

4 4
2 4

 

 

题意:给出两组数,我们求一个数比第一组的平均数低,比第二组的平均数高。求这个数的范围。这是一道水题,简单模拟。

Code:

#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
int T,n,m;
int main(){
scanf("%d",&T);
while (T--){
int sumx=0,sumy=0,minans=0,maxans=0;
double avex=0,avey=0;
scanf("%d%d",&n,&m);
for (int i=1;i<n;i++){
int x;
scanf("%d",&x);
sumx+=x;
avex=(double)sumx/(double)(n-1);
}
for (int i=1;i<=m;i++){
int y;
scanf("%d",&y);
sumy+=y;
avey=(double)(sumy)/(double)m;
}
for (int i=1;i<=100;i++){
double x=(double)(sumx+i)/(double)n;
double y=(double)(sumy+i)/(double)(m+1);
if (avex>x && y>avey){
minans=i;
break;
}
}
for (int i=100;i>=1;i--){
double x=(double)(sumx+i)/(double)n;
double y=(double)(sumy+i)/(double)(m+1);
if (avex>x && y>avey){
maxans=i;
break;
}
}
printf("%d %d\n",minans,maxans);
}
}

 

标签:integers,sumy,sumx,int,double,Average,Score,Bob
From: https://blog.51cto.com/u_15888102/5878360

相关文章

  • Batting Average
    ProblemStatementTakahashiismakingacomputerbaseballgame.Hewillwriteaprogramthatshowsabatter'sbattingaveragewithaspecifiednumberofdigits......
  • CF1285D Dr. Evil Underscores 题解
    给定一个序列\(a\),选取一个\(x\),使\(\max_{i=1}^na_i\oplusx\)最小。看到这种题直接按位考虑,如果最高位全是\(1\)那把\(x\)的这位全变成\(1\),如果最高位全是\(......
  • HDU2376 Average distance
    题目链接:传送门求树上任意两点间的路径和的平均值非常套路统计每条边被经过多少次就是两边的点数的乘积注意精度就好#include<cstdio>#include<cstring>#include<alg......
  • HDU2376——Average distance(思维+树形DP)
    原题链接:http://acm.hdu.edu.cn/showproblem.php?pid=2376原文:https://www.codenong.com/cs109682980/题意:给定一棵树,有边权,求树上任意两点之间距离的和的平均值。思路......
  • 关于underscore 在node中常用应用
    Underscore.js是一个很精干的库,压缩后只有4KB。它提供了几十种函数式编程的方法,弥补了标准库的不足,大大方便了JavaScript的编程。可以完美地应用到nodejs环境中。const_=......
  • 【GAN优化】最早被用于评价GAN模型的定量指标Inception Score是什么
    最近一部分的内容将会比较容易,将和大家一起讨论GAN的评价指标,也没有太难以理解的东西,希望大家踊跃讨论,欢迎留言。作者&编辑|小米粥编辑|言有三在判别模型中,训练完成的模......
  • [AGC041D] Problem Scores
    StOKubic神发现主要限制在第三个限制,考虑变形一下限制要求,问题转化为要求序列的\(k=\lfloor\dfrac{n}{2}\rfloor\),的前\(k+1\)项的和,大于后\(k\)项的和。动......
  • 初识:Precision、Recall、Accuracy、F1-Score
    一、定义对于一个数据集的测试,一般会产生四种结果:TP、TN、FP、FN(T:true,表示正确;F:false,表示错误;P:positive;N:negative)TP:truepositive,正样本,预测为正样本;TN:true......
  • TAD calling 之 insulation score 分析
    1.导读本文主要对insulationscore的提出与计算方法进行简要的介绍,并展示一个计算insulationscore的过程。2.定义insulationscore是dekker实验室在2015年发表于N......
  • Sum of Prefix Scores of Strings
    SumofPrefixScoresofStringsYouaregivenanarray words ofsizeco$n$sistingofnon-emptystrings.Wedefinethescoreofastring word asthenumber......