734B - Anton and Digits - CodeForces Solution

brute force greedy implementation math *800

Please click on ads to support us..

Python Code: 

k2,k3,k5,k6=[int(_) for _ in input().split()]
suma=0
if min(k5,k6)!=0 and k2>0:
    suma=min(k2, min(k5,k6))*256
if k3>0 and k2-min(k2, min(k5,k6))>0:
    suma+=min(k3,k2-min(k2, min(k5,k6)))*32
print(suma)


Comments

Submit
0 Comments
More Questions

1665D - GCD Guess
29A - Spit Problem
1097B - Petr and a Combination Lock
92A - Chips
1665B - Array Cloning Technique
1665A - GCD vs LCM
118D - Caesar's Legions
1598A - Computer Game
1605A - AM Deviation
1461A - String Generation
1585B - Array Eversion
1661C - Water the Trees
1459A - Red-Blue Shuffle
1661B - Getting Zero
1661A - Array Balancing
1649B - Game of Ball Passing
572A - Arrays
1455A - Strange Functions
1566B - MIN-MEX Cut
678C - Joty and Chocolate
1352E - Special Elements
1520E - Arranging The Sheep
1157E - Minimum Array
1661D - Progressions Covering
262A - Roma and Lucky Numbers
1634B - Fortune Telling
1358A - Park Lighting
253C - Text Editor
365B - The Fibonacci Segment
75A - Life Without Zeros