treesizes.py

from itertools import izip_longest

def grouper(n, iterable, fillvalue=None):
    "grouper(3, 'ABCDEFG', 'x') --> ABC DEF Gxx"
    args = [iter(iterable)] * n
    return izip_longest(fillvalue=fillvalue, *args)


def exp_treesize(data):
    data = data.split('\n')
    _treesizes = [float(row.split()[-1]) for row in data if row is not None]
    return sum(_treesizes) / len(_treesizes)


def main(data):
    rows = data.split('\n')
    experiments = grouper(10, rows)
    treesizes = []
    for exp in experiments:
        _treesizes = [int(row.split()[-1]) for row in exp if row is not None]
        treesizes.append(sum(_treesizes) / len(_treesizes))
    print(', '.join(map(str, treesizes)))