Codejam 2012 - Dancing with the Googlers

googlers_minimal.py

def acc(p, total):
  best, rest = divmod(total + 2, 3)
  return (1, 0) if best >= p else (0, total and rest and best + 1 == p)

for i, line in enumerate(input() for _ in range(int(input()))):
  _, S, p, *totals = map(int, line.split())
  a, s = map(sum, zip(*(acc(p, total) for total in totals)))
  print("Case #%d: %d" % (i + 1, a + min(s, S)))

@MartinThoma: check revision 036d17