minimalist multipoly in pynguin.py

def vector(angle,length):
   turnto(angle)
   forward(length)

def lcm(values):
   '''Returns the least common multiple of a list of integers.'''
   values.sort()
   biggest = values[-1]
   multiplier = 1
   while sum([(multiplier * biggest) % value for value in values]) != 0:
       multiplier += 1
   return biggest * multiplier

def comp_poly(vecs):
   '''Multipoly() that draws a closed shape using a minimum number of interations.'''
   for i in range(lcm([lcm([360,angle])/angle for angle, length in vecs])):
       for angle, length in vecs:
           vector(i*angle, length)