Round 1 - No rec

2017.1-RoundOne/a.PieProgress.py

@@ -0,0 +1,37 @@
+import numpy as np
+
+def choose(day, price, pies, S):
+    pies.append()
+    for i in len(S[day]):
+        if S[day][i] == price:
+            del S[day][i]
+            return
+
+def findBest(pies, S):
+
+def solve(N, M, S):
+    print("N={0}, M={1}".format(N, M))
+    print(S)
+
+    pies = []
+    # First day: chose the cheapest
+    pies[0] = min(S[0])
+    
+
+    # Next days
+    for i in range(1, M):
+        day, price = findBest(pies, S)
+        
+
+    return 'white'
+
+if __name__ == "__main__":
+    import fileinput
+    f = fileinput.input()
+
+    T = int(f.readline())
+    for case in range(1, T+1):
+        N, M = [int(i) for i in f.readline().split()]
+        S = [[int(i) for i in f.readline().split()] for x in range(N)]
+        solution = solve(N, M, S)
+        print("Case #{0}: {1}".format(case, solution))

2017.1-RoundOne/pie_progress_example_input.txt

@@ -0,0 +1,34 @@
+5
+3 2
+1 1
+100 100
+10000 10000
+5 1
+1
+2
+3
+4
+5
+5 5
+1 2 3 4 5
+2 3 4 5 1
+3 4 5 1 2
+4 5 1 2 3
+5 1 2 3 4
+5 5
+1 1 1 1 1
+2 2 2 2 2
+3 3 3 3 3
+4 4 4 4 4
+5 5 5 5 5
+10 4
+7 15 12 6
+15 3 19 18
+10 9 10 14
+12 14 8 8
+5 3 5 11
+9 14 19 11
+12 6 20 9
+18 13 12 15
+14 14 10 20
+11 19 12 11