Add files via upload

Author: Saptarshi-prog

Week 6/Maximum_amount_of_gold_knapsack.py

@@ -0,0 +1,23 @@
+import sys
+
+import numpy as np
+
+
+def optimal_weight(W, w):
+    # write your code here
+
+    matrix = np.zeros(shape=(len(w), W + 1), dtype=int)
+
+    for j in range(0, len(w)):
+        for i in range(1, W + 1):
+            if w[j] > i:
+                matrix[j, i] = matrix[j - 1, i]
+            else:
+                matrix[j, i] = max(w[j] + matrix[j - 1, i - w[j]], matrix[j - 1, i])
+    return matrix[len(w) - 1, W]
+
+
+if __name__ == '__main__':
+    input = sys.stdin.read()
+    W, n, *w = list(map(int, input.split()))
+    print(optimal_weight(W, w))

Week 6/Maximum_value_of_an_arithmetic_expression.py

@@ -0,0 +1,51 @@
+from math import inf
+
+import numpy as np
+
+
+def evalt(a, b, op):
+    if op == '+':
+        return a + b
+    elif op == '-':
+        return a - b
+    elif op == '*':
+        return a * b
+    else:
+        assert False
+
+
+def min_and_max(m, M, op, i, j):
+    tmp_min = inf
+    tmp_max = -inf
+
+    for k in range(i, j):
+        a = evalt(M[i][k], m[k + 1][j], op[k])
+        b = evalt(m[i][k], m[k + 1][j], op[k])
+        c = evalt(M[i][k], M[k + 1][j], op[k])
+        d = evalt(m[i][k], M[k + 1][j], op[k])
+
+        tmp_min = min(tmp_min, a, b, c, d)
+        tmp_max = max(tmp_max, a, b, c, d)
+
+    return (tmp_min, tmp_max)
+
+
+def get_maximum_value(dataset):
+    op = dataset[1:len(dataset):2]
+    d = dataset[0:len(dataset) + 1:2]
+    n = len(d)
+    m = np.zeros(shape=(n, n), dtype=int)
+    M = np.zeros(shape=(n, n), dtype=int)
+    for i in range(n):
+        m[i][i] = int(d[i])
+        M[i][i] = int(d[i])
+
+    for s in range(1, n):
+        for i in range(n - s):
+            j = i + s
+            m[i][j], M[i][j] = min_and_max(m, M, op, i, j)
+    return M[0][n - 1]
+
+
+if __name__ == "__main__":
+    print(get_maximum_value(input()))

Week 6/Partitioning_souvenirs.py

@@ -0,0 +1,18 @@
+import sys
+import itertools
+
+def partition3(A):
+    for c in itertools.product(range(3), repeat=len(A)):
+        sums = [None] * 3
+        for i in range(3):
+            sums[i] = sum(A[k] for k in range(len(A)) if c[k] == i)
+
+        if sums[0] == sums[1] and sums[1] == sums[2]:
+            return 1
+
+    return 0
+
+if __name__ == '__main__':
+    input = sys.stdin.read()
+    n, *A = list(map(int, input.split()))
+    print(partition3(A))