Enable Javascript in your browser and then refresh this page, for a much enhanced experience.
Third solution in Uncategorized category for Evenly Spaced Trees by vvm70
from functools import reduce
from math import gcd
def evenly_spaced_trees(trees):
return (trees[-1] - trees[0]) // reduce(gcd,
[*map(int.__sub__, trees[1:], trees)]) + 1 - len(trees)
if __name__ == '__main__':
print("Example:")
print(evenly_spaced_trees([0, 2, 6]))
print(evenly_spaced_trees([10, 58, 64, 82, 91]))
assert evenly_spaced_trees([0, 2, 6]) == 1, 'add 1'
assert evenly_spaced_trees([1, 3, 6]) == 3, 'add 3'
assert evenly_spaced_trees([0, 2, 4]) == 0, 'no add'
print("Coding complete? Click 'Check' to earn cool rewards!")
March 20, 2021
