CodeForces604AUncowed 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

代码：

#include<stdio.h>
double max(double a,double b)
{
	return a>b?a:b;
}
int main()
{
	double m[6];
	double w[6];
	double h[3];
	double fen[6];
	double f[6]={0,500,1000,1500,2000,2500};
	double scorce=0;
		for(int i=1;i<=5;i++)
		{
			scanf("%lf",&m[i]);
		}
		for(int i=1;i<=5;i++)
		{
			scanf("%lf",&w[i]);
		}for(int i=1;i<=2;i++)
		{
			scanf("%lf",&h[i]);
		}
		for(int i=1;i<=5;i++)
		{
			fen[i]=max(0.3*f[i],(1-(m[i]/250))*f[i]-50*w[i]);
			scorce+=fen[i];
		}
		scorce+=(h[1]*100-h[2]*50);
		printf("%.0lf\n",scorce);
	return 0;
}

思路：一个人参加竞赛，总共有五道题，告诉你这个人每道题花了多长时间，错了多少次，
成功和不成功的次数。让你按照他所给的公式求出这个人最后得到的分值。主要注意的就是要用double类型输入。还有最后输出的时候注意保存整数用%.0lf不要直接double的输出%d，这样是输不出来值的。