problem2.py

# there is a more straightforward solution, but this test is boring, so here's a generator-based version :P
# Fibonacci generator
def fibgen():
    '''generator that yields fibonacci numbers''' 
    yield 0
    crnt = 0
    nxt = 1
    while True:
        crnt, nxt = nxt, crnt+nxt
        yield crnt
        
def oddgen(gen):
     '''return only the odd results from a generator'''
     while True:
         val = gen.__next__()
         if val%2!=0:
             yield val

def stop_at_value(stop_val, gen):
    '''stop returning values from a generator if value returned is greater than stop_val'''
    while True:
        val = gen.__next__()
        if val < stop_val:
            yield val
        else:
            return
solution_generator = stop_at_value(10000, oddgen(fibgen()))
answer = sum(solution_generator) # => 14328