Codeforces Round #334 (Div. 2)A. Uncowed Forces（简单计算）

题目链接
题意：告诉CF的rating计算公式，让你计算一个人的分数，
解答：直接double，免除一切烦恼

#define CF
#ifndef CF
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<string>
#include<iostream>
#include<set>
#include<vector>
#else
#include<bits/stdc++.h>
#endif // CF
using namespace std;
#define LL long long
#define pb push_back
#define X first
#define Y second
#define cl(a,b) memset(a,b,sizeof(a))
typedef pair<long long ,long long > P;
const int maxn=1000005;
const LL inf=1LL<<60;
const LL mod=1e9+7;
double x[]={500,1000,1500,2000,2500};
int main(){
    double m[5];
    for(int i=0;i<5;i++){
        cin>>m[i];
    }
    double w[5];
    for(int i=0;i<5;i++){
        cin>>w[i];
    }
    double h[2];
    cin>>h[0]>>h[1];

    double sum=0;

    for(int i=0;i<5;i++){
        sum+=max(0.3*x[i],(1-m[i]/250.0)*x[i]-50*w[i]);
    }
    sum+=h[0]*100-h[1]*50;
    printf("%.0lf\n",sum);
    return 0;
}