Uncowed Forces
来源:互联网 发布:sql注入点 编辑:程序博客网 时间:2024/05/23 19:58
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 <iostream>#include <cstdio>int main(){ double m[1000],w[1000],str[100]={500,1000,1500,2000,2500}; double max[100]; for(int i=0;i<5;i++) { scanf("%lf",&m[i]); } for(int i=0;i<5;i++) { scanf("%lf",&w[i]); } int s,f; scanf("%d %d",&s,&f); int sum; double p,t;for(int j=0;j<5;j++){ p=1.0*m[j]/250.0; t=(1-p)*str[j]-50*w[j];if(0.3*str[j]>=t){ max[j]=3*str[j]/10;}else max[j]=t;}for(int j=0;j<5;j++){sum+=max[j];}sum=sum+100*s-50*f; printf("%d\n",sum); return 0; }
- Uncowed Forces
- Uncowed Forces
- Uncowed Forces
- Uncowed Forces
- Uncowed Forces
- Uncowed Forces
- Uncowed Forces
- Uncowed Forces
- Uncowed Forces
- Uncowed Forces
- 604A Uncowed Forces
- A. Uncowed Forces
- D - Uncowed Forces
- 【codeforces】Uncowed Forces
- 【codeforces】Uncowed Forces
- Uncowed Forces 【水题】
- codeforces 604A Uncowed Forces
- Uncowed Forces Codeforces Round #334
- 第一天有利网的工作(python安全开发)
- uitexture实现新手引导遮罩等
- 如何使用函数公式来查找图片
- 独木舟上的旅行
- Centos7下GitLab服务器的搭建
- Uncowed Forces
- 关于Unity3D脚本中UIEventListener无法调用的问题
- Form表单数据传输方式之Get与Post区别
- spring 不返回某个字段
- PowerDesigner 15.1 安装步骤及破解、汉化
- 调节按钮亮度,调节扁平化
- springboot的邮件服务
- 23种设计模式汇总整理
- Flex 布局