Uncowed Forces
来源:互联网 发布:c 面向对象编程 编辑:程序博客网 时间:2024/06/05 16:37
点击打开链接
Uncowed Forces
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 isx, and Kevin submitted correctly at minutem 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 by50 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, wheremi (0 ≤ mi ≤ 119) is the time of Kevin's last submission for problemi. His last submission is always correct and gets accepted.
The second line contains five space-separated integers w1, w2,w3, w4, w5, wherewi (0 ≤ wi ≤ 10) is Kevin's number of wrong submissions on problemi.
The last line contains two space-separated integers hs andhu (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 in10·100 = 1000 points from hacks, his total score becomes3930 + 1000 = 4930.
下面是我的代码:
#include<cstdio>#include<algorithm>#include<cstring>#include<cmath>#include<cstdlib>#include<iostream>using namespace std;int main(){double m1, m2, m3, m4,m5,w1, w2, w3, w4, w5,hu,hs,max1,max2,max3,max4,max5;while(scanf("%lf%lf%lf%lf%lf",&m1,&m2,&m3,&m4,&m5)!=EOF){double p1,p2,p3,p4,p5,endd;; scanf("%lf%lf%lf%lf%lf",&w1,&w2,&w3,&w4,&w5);scanf("%lf%lf",&hu,&hs);p1=(1-m1/250)*500-50*w1;p2=(1-m2/250)*1000-50*w2;p3=(1-m3/250)*1500-50*w3;p4=(1-m4/250)*2000-50*w4;p5=(1-m5/250)*2500-50*w5;max1=max((0.3*500),p1);max2=max((0.3*1000),p2);max3=max((0.3*1500),p3);max4=max((0.3*2000),p4);max5=max((0.3*2500),p5);hu=hu*100;hs=hs*(-50);endd=max1+max2+max3+max4+max5+hu+hs;printf("%.0lf\n",endd);}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
- linux睡眠和唤醒的一个例子
- leetCode 1. Two Sum
- python logging的使用
- 小白笔记-----------------------------leetcode53. Maximum Subarray
- IO重定向
- Uncowed Forces
- DOM(二)
- mongodb replica sets(复制集)配置与搭建
- uva 11464 暴力枚举矩阵
- 整理音乐(多个链表的重复归并问题)
- Android中Log的重要性
- 由前序遍历和中序遍历重建二叉树和C语言模式实现C++继承和多态——题集(十四)
- html之图像
- 题目1054:字符串内排序