【Codeforces 604A】Uncowed Forces
来源:互联网 发布:交通大数据的优缺点 编辑:程序博客网 时间:2024/05/16 01:09
Uncowed Forces
Description
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.
Input
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.
Output
Print a single integer, the value of Kevin’s final score.
Sample Input
Input
20 40 60 80 100
0 1 2 3 4
1 0
Output
4900
Input
119 119 119 119 119
0 0 0 0 0
10 0
Output
4930
Hint
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<stdio.h>#include<algorithm>#include<math.h>using namespace std;int main(){ int a[5],b[5],i,nd,nc,sum; while(scanf("%d",&a[0])!=EOF) { sum=0; for(i=1;i<5;i++) scanf("%d",&a[i]); for(i=0;i<5;i++) scanf("%d",&b[i]); scanf("%d%d",&nd,&nc); for(i=0;i<5;i++) sum+=max(150*(i+1),(250-a[i])*2*(i+1)-50*b[i]); sum=sum+100*nd-50*nc; printf("%d\n",sum); }}
- codeforces 604A 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(水)
- 【codeforces】-604A-Uncowed Forces(水)
- 【51.27%】【codeforces 604A】Uncowed Forces
- CodeForces 604 A.Uncowed Forces(水~)
- 604A Uncowed Forces
- 【codeforces】Uncowed Forces
- 【codeforces】Uncowed Forces
- A. Uncowed Forces
- Codeforces Round #334 (Div. 2) A. Uncowed Forces
- Codeforces Round #334 (Div. 2) A. Uncowed Forces
- Codeforces Round #334 (Div. 2) A. Uncowed Forces
- Codeforces Round #334 (Div. 2) A. Uncowed Forces (水题)
- CSDN博客常见问题
- linux安装yum源
- [bzoj1369][Baltic2003]Gem(树上dp)
- RDD Transformation——takeSample
- 【学习笔记】让一个块级元素上下左右居中 ps:初学者求轻虐
- 【Codeforces 604A】Uncowed Forces
- HTTP Status 500 - Servlet.init() for servlet springMVC threw exception
- Android开发中需要注意哪些坑
- 字符集合---- 华为2016研发工程师编程题
- inotify不生效问题
- hadoop 处理文件的过程
- SSH整合,完成简单的增删改查——实习总结01
- android 点击按钮切换背景图片(根据按钮点击的ID切换)
- 对PATH的一些理解