feat: added alternative python solutions.

subset-sum/src/alternative-ac.py

@@ -0,0 +1,15 @@
+n, t = map(int, input().split())
+books = list(map(int, input().split()))
+
+dp = [False] * (t + 1)
+dp[0] = True
+
+for book in books:
+    for i in range(t, book - 1, -1):
+        if dp[i - book]:
+            dp[i] = True
+
+if dp[t]:
+    print("PERFEITO!")
+else:
+    print("IMPOSSIVEL!")