Codeforces Round #334（div.2） A

A. Uncowed Forces

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

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 test(s)

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

Note

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 = 1000points from hacks, his total score becomes 3930 + 1000 = 4930.

 

模拟题，按照题意来就可以，不过注意下精度，因为看到学长多次错在第六组数据上面

?

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38

#include<stdio.h> //#include<bits/stdc++.h> #include<string.h> #include<iostream> #include<math.h> #include<sstream> #include<set> #include<queue> #include<map> #include<vector> #include<algorithm> #include<limits.h> #define inf 0x3fffffff #define INF 0x3f3f3f3f #define lson l,m,rt<<1 #define rson m+1,r,rt<<1|1 #define LL long long #define ULL unsigned long long using namespace std; int a[100000]; int n,m; int i,j; double t,ans,num,sum,flag; int main() {     double m1,m2,m3,m4,m5;     double w1,w2,w3,w4,w5;     double num1,num2;     cin>>m1>>m2>>m3>>m4>>m5;     cin>>w1>>w2>>w3>>w4>>w5;     cin>>num1>>num2;     sum=0;     sum=max(0.3*500,(double)(1-m1/250*1.0)*500-50*w1*1.0)+max(0.3*1000,(double)(1-m2/250*1.0)*1000-50*w2*1.0)+max(0.3*1500,(double)(1-m3/250*1.0)*1500-50*w3*1.0)+max(0.3*2000,(double)(1-m4/250*1.0)*2000-50*w4*1.0)+max(0.3*2500,(double)(1-m5/250*1.0)*2500-50*w5*1.0);    // cout<<sum<<endl;     sum+=num1*100-num2*50;     cout<<(int)sum<<endl;     return 0; }