604A - Uncowed Forces - CodeForces Solution


implementation *1000

Please click on ads to support us..

C++ Code:

#include<bits/stdc++.h>
using namespace std;
// #define int long long int 
void h(){
    double m1,m2,m3,m4,m5;cin>>m1>>m2>>m3>>m4>>m5;
    double w1,w2,w3,w4,w5;cin>>w1>>w2>>w3>>w4>>w5;
    double hs,hu;cin>>hs>>hu;
    double ans=max(150.0,(1-m1/250)*500-50*w1)+max(300.0,(1-m2/250)*1000-50*w2)+max(450.0,(1-m3/250)*1500-50*w3)+max(600.0,(1-m4/250)*2000-50*w4)+max(750.0,(1-m5/250)*2500-50*w5);
    cout<<ans+hs*100.0-hu*50.0<<endl;
}
int main(){
    // int t;cin>>t;
    // while(t--){
        h();
    // }
}


Comments

Submit
0 Comments
More Questions

1062B - Math
1294C - Product of Three Numbers
749A - Bachgold Problem
1486B - Eastern Exhibition
1363A - Odd Selection
131B - Opposites Attract
490C - Hacking Cypher
158B - Taxi
41C - Email address
1373D - Maximum Sum on Even Positions
1574C - Slay the Dragon
621A - Wet Shark and Odd and Even
1395A - Boboniu Likes to Color Balls
1637C - Andrew and Stones
1334B - Middle Class
260C - Balls and Boxes
1554A - Cherry
11B - Jumping Jack
716A - Crazy Computer
644A - Parliament of Berland
1657C - Bracket Sequence Deletion
1657B - XY Sequence
1009A - Game Shopping
1657A - Integer Moves
230B - T-primes
630A - Again Twenty Five
1234D - Distinct Characters Queries
1183A - Nearest Interesting Number
1009E - Intercity Travelling
1637B - MEX and Array