def even_split(n, k):
    """
    n and k must be ints.
    
    returns a list of as-even-as-possible shares when n is divided into k pieces.

    Excess is left for the end.  If you want random order, shuffle the output.

    >>> even_split(2,1)
    [2]
    
    >>> even_split(2,2)
    [1, 1]

    >>> even_split(3,2)
    [1, 2]

    >>> even_split(11,3)
    [3, 4, 4]
    """
    ans = []
    if type(n) is not int or type(k) is not int:
        raise TypeError("n and k must be ints")

    r = n % k
    ans = ([n/k] * (k-r))
    ans.extend([n/k + 1] * r)
    return ans