
Untitled
By: a guest on
May 7th, 2012 | syntax:
Python | size: 0.63 KB | hits: 29 | expires: Never
from itertools import chain, combinations
def party_combinations(blah):
return chain(*map(lambda x: combinations(blah, x), range(0, len(blah)+1)))
def print_subset(lcombo, value):
lstr = "%d : " % value
for i in lcombo:
lstr += parties[i][0] + " "
print lstr
def more_than_enough(lcombo):
local_sum = 0
for i in lcombo:
local_sum += parties[i][1]
if local_sum > 150:
print_subset(lcombo, local_sum)
parties = { 1:('nd', 108), 2: ('syriza',52), 3: ('pasok',41), 4: ('ae',33), 5: ('kke',26), 6: ('xa',21), 7:('dhmar',19)}
for subset in party_combinations(parties):
more_than_enough(subset)