HDU 5268 ZYB loves Score (BestCoder Round#44)

原创 2015年07月06日 22:48:17

题目链接:ZYB loves Score


题面:

ZYB loves Score

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 395    Accepted Submission(s): 232


Problem Description
One day,ZYB participated in the BestCoder Contest 

There are four problems. Their scores are 1000,1500,2000,2500 

According to the rules of BestCoder,If you solve one problem at x minutes,
You will get (250-x)/250100% of the original scores.

Obviously the final score must be an integer,becasue the original scores are multiple of 250

And if you make x wrong submissions,the score of this problem you get will be reduced by 50

For example, if you solved the first problem in 5 minutes and you make one wrong submisson, the score of this problem is 980-50=930 

To prevent very low scores,the lowest score of one problem is 40% of its original score
 

Input
Multiple test cases, the first line contains an integer T(no more than 20), indicating the number of cases. Each test case contains four lines

For i-th line of each test case there are two integers A,B which means you solved the i-th problem in A minutes and you have made B wrong submissons.

0A1050B100
 

Output
For each case, the output should occupies exactly one line. The output format is Case #x: ans, here x is the data number begins at 1.
 

Sample Input
2 4 0 12 0 20 0 103 0 17 1 29 0 57 0 84 0
 

Sample Output
Case #1: 5722 Case #2: 5412
 

Source
 


解题:套下公式即可,注意分数不能低于40%。


代码:

#include <iostream>
#include <cmath> 
#define e  2.718281828459
using namespace std;
int max(double a,int b)
{
	if(a>b)return (int)a;
	else return b;
}
int main()
{
	int t,total,timee,wrong;
	cin>>t;
	for(int i=1;i<=t;i++)
	{
		total=0;
		for(int j=1000;j<=2500;j+=500)
		{
			cin>>timee>>wrong;
			total+=max((250.0-timee)/250*j-wrong*50,j*2/5);
		}
		cout<<"Case #"<<i<<": "<<total<<endl;
	}
   return 0; 
}


版权声明:欢迎交流!

hdu 5269 ZYB loves Xor I && BestCoder Round #44

题意: ZYB喜欢研究Xor,现在他得到了一个长度为n的数组A。于是他想知道:对于所有数对(i,j)(i∈[1,n],j∈[1,n]),lowbit(AixorAj)之和为多少.由于答案可能过大,你...

HDU 5269 ZYB loves Xor I——BestCoder Round #44(字典树)

HDU 5269 ZYB loves Xor I——BestCoder Round #44(字典树)

HDU 5269 && BestCoder #44 1002 ZYB loves Xor I (分治)

题目地址:HDU 5269 比赛的时候想到了分治的思路,但是脑残了。,。写麻烦了。。。调了好久也没调出来。。赛后优化了一下。。就过了。。 我的思路是先排序,排序是按照的将每个数字的二进制表示倒过来...

HDU 5272 Dylans loves numbers——BestCoder Round #45(模拟)

HDU 5272 Dylans loves numbers——BestCoder Round #45(模拟)

HDU 5997 BestCoder Round #90 1003 rausen loves cakes 线段树 树状数组

题目地址:http://acm.hdu.edu.cn/showproblem.php?pid=5997 题意:给出一个长度为n的数组,数组里的元素是[1,1000000]中的整数,代表一个颜...
  • dpppBR
  • dpppBR
  • 2016年12月21日 19:07
  • 222

hdu 5228 ZCC loves straight flush && BestCoder Round #41 1001

在前往ZJOI2015一试的路上,ZCC在同Fsygd打德州扑克时输光了所有的筹码。不过ZCC最近学会了一些黑技术。现在,他能够在游戏过程中更换任何他想要更换的牌。ZCC想要通过更换尽量少的牌得到同花...

hdu 5196 DZY Loves Inversions && BestCoder Round #35

问题描述 DZY有一个序列a,一共由n个正整数组成,下标为1到n。我们定义第i个数为ai。 DZY每次给定一个数对(l,r)(l≤r),他想计算有多少个数对(i,j),满足l≤i≤j≤r,且序列 b...

HDU 5806 BestCoder Round #86 NanoApe Loves Sequence Ⅱ (尺取法)

NanoApe Loves Sequence Ⅱ  题目链接:点我打开链接 Source BestCoder Round #86  题意:问你这个数列中有多少个区间里的第 k大的数不小于...

【HDU5805 BestCoder Round 86B】【前后缀和】NanoApe Loves Sequence 删除一数后数列max(相邻数绝对值)

NanoApe Loves Sequence    Accepts: 531    Submissions: 2481  Time Limit: 2000/1000 MS (Java/O...

BestCoder Round #43 HDU5265 pog loves szh II 排序+贪心

pog loves szh II                                                                    Time Limit: 400...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:HDU 5268 ZYB loves Score (BestCoder Round#44)
举报原因:
原因补充:

(最多只允许输入30个字)