def make_bricks(small, big, goal): """ We want to make a row of bricks that is goal inches long. We have a number of small bricks (1 inch each) and big bricks (5 inches each). Return True if it is possible to make the goal by choosing from the given bricks. This is a little harder than it looks and can be done without any loops. """ resto = goal resto -= 5*min(big,goal/5) return resto-small <= 0 def lone_sum(a, b, c): """ Given 3 int values, a b c, return their sum. However, if one of the values is the same as another of the values, it does not count towards the sum. """ sum = 0 sum += a if a not in [b,c] else 0 sum += b if b not in [a,c] else 0 sum += c if c not in [a,b] else 0 return sum def lucky_sum(a, b, c): """ Given 3 int values, a b c, return their sum. However, if one of the values is 13 then it does not count towards the sum and values to its right do not count. So for example, if b is 13, then both b and c do not count. """ sum = 0 list = [a,b,c,13] for n in list[:list.index(13)]: sum += n return sum def no_teen_sum(a, b, c): """ Given 3 int values, a b c, return their sum. However, if any of the values is a teen -- in the range 13..19 inclusive -- then that value counts as 0, except 15 and 16 do not count as a teens. Write a separate helper "def fix_teen(n):" that takes in an int value and returns that value fixed for the teen rule. In this way, you avoid repeating the teen code 3 times (i.e. "decomposition"). """ def fix_teen(n): return n if n not in [13,14,17,18,19] else 0 return fix_teen(a)+fix_teen(b)+fix_teen(c) def round_sum(a, b, c): """ For this problem, we'll round an int value up to the next multiple of 10 if its rightmost digit is 5 or more, so 15 rounds up to 20. Alternately, round down to the previous multiple of 10 if its rightmost digit is less than 5, so 12 rounds down to 10. Given 3 ints, a b c, return the sum of their rounded values. To avoid code repetition, write a separate helper "def round10(num):" and call it 3 times. """ def round10(num): return (num+5)/10*10 return round10(a)+round10(b)+round10(c) def close_far(a, b, c): """ Given three ints, a b c, return True if one of b or c is "close" (differing from a by at most 1), while the other is "far", differing from both other values by 2 or more. Note: abs(num) computes the absolute value of a number. """ return (abs(abs(b)-abs(c))>=2) and \ ((abs(abs(b)-abs(a))<=1 and abs(abs(c)-abs(a))>=2) \ or (abs(abs(c)-abs(a))<=1 and abs(abs(b)-abs(a))>=2))