Enable Javascript in your browser and then refresh this page, for a much enhanced experience.
First solution in Clear category for Evenly Spaced Trees by eugene100372
from typing import List
from math import*
from functools import*
def evenly_spaced_trees(trees: List[int]) -> int:
return ((max(trees)-min(trees))//reduce(lambda x,y:gcd(x,y),
(el-min(trees) for el in trees))-len(trees)+1)
if __name__ == '__main__':
print("Example:")
print(evenly_spaced_trees([0, 2, 6]))
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!")
April 17, 2019
