zeeshanlakhani

#!/usr/bin/env python2
from itertools import combinations

def number_of_disc_intersections(A):
    boundries = list()

    for x, r in enumerate(A):
        boundries.append((x-r, x+r))
    
    r = range(len(A))

zeeshanlakhani

;; Deriving something like generators, but I didn't really feel like
;; doing exactly that.

;; It doesn't, for instance, support sending back into the generator

;; This applys a function across a range from 0 to x.
(define (apply-to-range f i x)
  (when (< i x)
    (f i)
    (apply-to-range f (+ 1 i) x)))