912A - Tricky Alchemy - CodeForces Solution


implementation *800

Please click on ads to support us..

Python Code:


import math
import os
import random
import re
import sys
from math import gcd
from math import sqrt
from collections import Counter

a,b = list(map(int,input().split()))
x,y,z = list(map(int,input().split()))

p = max(0,2*x+y-a)
q = max(0,3*z+y-b)
print(p+q)

C++ Code:

#include<bits/stdc++.h>
using namespace std;
#define optimize() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
int main()
{
    optimize();
long long int a,b;
cin>>a>>b;
long long int x,y,z;
cin>>x>>y>>z;
long long int bl,ye;
ye=x*2;
ye+=y;
bl=y+z*3;

long long int c,d;
if(ye<=a)c=0;
else c=ye-a;
if(bl<=b)d=0;
else d=bl-b;
//cout<<c<<endl<<d<<endl;
cout<<c+d<<endl;
return 0;
}


Comments

Submit
0 Comments
More Questions

1582C - Grandma Capa Knits a Scarf
492A - Vanya and Cubes
217A - Ice Skating
270A - Fancy Fence
181A - Series of Crimes
1638A - Reverse
1654C - Alice and the Cake
369A - Valera and Plates
1626A - Equidistant Letters
977D - Divide by three multiply by two
1654B - Prefix Removals
1654A - Maximum Cake Tastiness
1649A - Game
139A - Petr and Book
1612A - Distance
520A - Pangram
124A - The number of positions
1041A - Heist
901A - Hashing Trees
1283A - Minutes Before the New Year
1654D - Potion Brewing Class
1107B - Digital root
25A - IQ test
785A - Anton and Polyhedrons
1542B - Plus and Multiply
306A - Candies
1651C - Fault-tolerant Network
870A - Search for Pretty Integers
1174A - Ehab Fails to Be Thanos
1169A - Circle Metro