Hdu 5268 (BestCoder Round #44 A)

http://acm.hdu.edu.cn/showproblem.php?pid=5268
简单水题:
只给出代码:

#include <iostream>
#include <algorithm>
using namespace std;
int main()
{
    int T,a,b;
    cin>>T;
    for(int k=1; k<=T; k++)
    {
        int sum,ans=0;
        for(int i=2; i<=5; i++)
        {
            cin>>a>>b;
            sum=2*i*(250-a)-50*b;
            ans+=max(sum,(int)(0.4*i*500));
        }
        cout<<"Case #"<<k<<": "<<ans<<endl;
    }
    return 0;
}
时间: 2025-01-20 23:12:35

Hdu 5268 (BestCoder Round #44 A)的相关文章

HDU 5651 xiaoxin juju needs help(BestCoder Round #77 (div.1)1001)

传送门 xiaoxin juju needs help Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 861    Accepted Submission(s): 243 Problem Description As we all known, xiaoxin is a brilliant coder. He knew **palin

hdu 5563 Clarke and five-pointed star 【BestCoder Round #62 (div.2) 1002】

Click here ~~ Clarke and five-pointed star Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 242    Accepted Submission(s): 144 Problem Description Clarke is a patient with multiple personality d

hdu 5464 Clarke and problem (BestCoder Round #56 (div.2))

Clarke and problem Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 350    Accepted Submission(s): 151 Problem Description Clarke is a patient with multiple personality disorder. One day, Clarke

hdu 5504 GT and sequence【BestCoder Round #60 】

GT and sequence Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 1441    Accepted Submission(s): 336 Problem Description You are given a sequence of N integers. You should choose some numbers(at

hdu 5523 Game 【BestCoder Round #61 (div.2)】

Game Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others) Total Submission(s): 315    Accepted Submission(s): 126 Problem Description XY is playing a game:there are N pillar in a row,which numbered from 1 to n.Each pi

hdu 5505 GT and numbers【BestCoder Round #60】

GT and numbers Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 1066    Accepted Submission(s): 285 Problem Description You are given two numbers N and M. Every step you can get a new N in the w

hdu 5499 SDOI 【BestCoder Round #59 (div.2) 】

SDOI Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others) Total Submission(s): 298    Accepted Submission(s): 117 Problem Description The Annual National Olympic of Information(NOI) will be held.The province of Shando

hdu 5500 Reorder the Books 【BestCoder Round #59 (div.2) 第二题】

Reorder the Books Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others) Total Submission(s): 244    Accepted Submission(s): 168 Problem Description dxy has a collection of a series of books called "The Stories of SDOI&

hdu 5463 Clarke and minecraft(BestCoder Round #56 (div.2))

Clarke and minecraft Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 314    Accepted Submission(s): 163 Problem Description Clarke is a patient with multiple personality disorder. One day, Clar