egyptian_greedy.py

from fractions import Fraction as F


class NotSolved(Exception):
    pass


def odd_solve(t):
    coll = []
    zero = F(0, 1)
    for i in xrange(10**5):
        c = 2 * i + 1
        if t - F(1, c) >= zero:
            coll.append(c)
            t -= F(1, c)
            if t == zero:
                break
    if t != zero:
        raise NotSolved
    return coll


if __name__ == "__main__":
    from sys import argv
    nom, denom = map(int, argv[1:3])
    print odd_solve(F(nom, denom))