Opt: 01, 17

2015/01.py

@@ -12,8 +12,8 @@ except Exception as e:
 
 res1, res2 = 0, 0
 
-for i in range(len(input)):
-	match input[i]:
+for c in input:
+	match c
 		case '(':
 			res1 += 1
 		case ')':

2015/17.py

@@ -7,36 +7,41 @@ except Exception as e:
 	print(f"An error occurred: {e}")
 
 # Reverse sort input
-input= [ int(x) for x in input.split()]
-l = len(input)
 
-res1, res2, min_popcount = 0, 0, l
-for i in range(1<<l):
 """
 Let: 
-		f: i -> [input[j] for j in range(len(X)) if i & 1<<j ]
+	f: i -> X[j] for j in range(len(X)) if i & 1<<j ]
 
 Then:
-		f is bijection between range(2**len(X)) and the subsets of X.
+	f is bijection between range(2**len(X)) and the P(X).
 
 Futhermore:
 	popcount(i) == len(f(i))
 """
 
+def powerset(X):
+	return [[ X[j] for j in range(len(X)) if i & 1<<j ] for i in range(1<<len(X))]
 	
-	if sum([input[j] for j in range(l) if i & 1<<j ]) != 150:
+
+input= [ int(x) for x in input.split()]
+
+res1, res2, min_l = 0, 0, len(input)
+
+for s in powerset(input):
+	if sum(s) != 150:
 		continue
 
 	res1 += 1
 
-	popcount =  i.bit_count()
-	if popcount < min_popcount:
-		min_popcount = popcount
+	l =  len(s)
+
+	if l < min_l:
+		min_l = l
 		res2 = 0;
-	if popcount == min_popcount:
+	if l == min_l:
 		res2 += 1;
 
 print(res1, res2)
 
 # One Liner
-print( sum([ sum( [input[j] for j in range(l) if i & 1<<j ]) == 150 for i in range(1<<l)] ))
+#print( sum([ sum( [input[j] for j in range(len(input)) if i & 1<<j ]) == 150 for i in range(1<<len(input))] ))