Chairs.py

from math import ceil as c
def best_score(n):
    score = lambda l:abs(l[1]-l[0])+(l[0]*l[1]-n)
    possible = []
    for i in range(1,n+1):
        possible.append((i, c(n/i)))
    return min(possible, key=score)


for i in range(1, 100):
    print("{}:\t{}".format(i, best_score(i)))