A. Uncowed Forces
来源:互联网 发布:百度大数据预测双色球 编辑:程序博客网 时间:2024/05/29 16:09
Kevin Sun has just finished competing in Codeforces Round #334! The round was 120 minutes long and featured five problems with maximum point values of 500, 1000, 1500, 2000, and 2500, respectively. Despite the challenging tasks, Kevin was uncowed and bulldozed through all of them, distinguishing himself from the herd as the best cowmputer scientist in all of Bovinia. Kevin knows his submission time for each problem, the number of wrong submissions that he made on each problem, and his total numbers of successful and unsuccessful hacks. Because Codeforces scoring is complicated, Kevin wants you to write a program to compute his final score.
Codeforces scores are computed as follows: If the maximum point value of a problem is x, and Kevin submitted correctly at minute m but made w wrong submissions, then his score on that problem is . His total score is equal to the sum of his scores for each problem. In addition, Kevin's total score gets increased by 100 points for each successful hack, but gets decreased by 50 points for each unsuccessful hack.
All arithmetic operations are performed with absolute precision and no rounding. It is guaranteed that Kevin's final score is an integer.
The first line of the input contains five space-separated integers m1, m2, m3, m4, m5, where mi (0 ≤ mi ≤ 119) is the time of Kevin's last submission for problem i. His last submission is always correct and gets accepted.
The second line contains five space-separated integers w1, w2, w3, w4, w5, where wi (0 ≤ wi ≤ 10) is Kevin's number of wrong submissions on problem i.
The last line contains two space-separated integers hs and hu (0 ≤ hs, hu ≤ 20), denoting the Kevin's numbers of successful and unsuccessful hacks, respectively.
Print a single integer, the value of Kevin's final score.
20 40 60 80 1000 1 2 3 41 0
4900
119 119 119 119 1190 0 0 0 010 0
4930
In the second sample, Kevin takes 119 minutes on all of the problems. Therefore, he gets of the points on each problem. So his score from solving problems is . Adding in 10·100 = 1000 points from hacks, his total score becomes 3930 + 1000 = 4930.
解题说明:此题是一道数学题,按照题目中的公式计算即可。
#include<cstdio>#include <cstring>#include<cmath>#include<iostream>#include<algorithm>#include<vector>using namespace std;int main(){int m[5],w[5],h[2],mw[5],i,score=0;int c[5]={150,300,450,600,750};for(i=0;i<5;i++){scanf("%d",&m[i]);}for(i=0;i<5;i++){scanf("%d",&w[i]);}for(i=0;i<2;i++){scanf("%d",&h[i]);}for(i=0;i<5;i++){mw[i]=(250-m[i])*(i+1)*2-50*w[i];}for(i=0;i<5;i++){if(mw[i]>c[i]){score+=mw[i];}else{score+=c[i];}}score=score+(h[0]*100)-(h[1]*50);printf("%d\n",score);return 0;}
- 604A Uncowed Forces
- A. Uncowed Forces
- codeforces 604A Uncowed Forces
- 【CodeForces】[604A]Uncowed Forces
- CodeForces 604A Uncowed Forces
- CodeForces 604A Uncowed Forces
- CodeForces】604A - Uncowed Forces
- 【Codeforces 604A】Uncowed Forces
- Uncowed Forces
- Uncowed Forces
- Uncowed Forces
- Uncowed Forces
- Uncowed Forces
- Uncowed Forces
- Uncowed Forces
- Uncowed Forces
- Uncowed Forces
- Uncowed Forces
- 判断几个参数的不同状态,不同的情况写SQL语句判断条件,优化做法(仅供新手)
- git一些操作命令
- 程序猿必知的swift单例编写的正确方式
- iOS定位添加大头针
- 加载系统相册中图片错误CGBitmapContextCreate: unsupported color space.
- A. Uncowed Forces
- 自定义Dialog和DialogFragment
- core animation初识之CALayer(二)
- 一看就懂的ReactJs入门教程(精华版)
- 对话屏幕Dynpro(SE51) 屏幕元素 屏幕属性 PAI事件的触发、屏幕元素Function Code设置 屏幕流逻辑Screen Flow Logic 对话屏幕中的字段命名大小写问题
- 制作网站缩略标志
- 数据多自动往上滚动
- Geolocation 地理定位
- 黑马程序员——Java高新技术---反射