|
@@ -0,0 +1,37 @@
|
|
1
|
+import numpy as np
|
|
2
|
+
|
|
3
|
+def choose(day, price, pies, S):
|
|
4
|
+ pies.append()
|
|
5
|
+ for i in len(S[day]):
|
|
6
|
+ if S[day][i] == price:
|
|
7
|
+ del S[day][i]
|
|
8
|
+ return
|
|
9
|
+
|
|
10
|
+def findBest(pies, S):
|
|
11
|
+
|
|
12
|
+def solve(N, M, S):
|
|
13
|
+ print("N={0}, M={1}".format(N, M))
|
|
14
|
+ print(S)
|
|
15
|
+
|
|
16
|
+ pies = []
|
|
17
|
+ # First day: chose the cheapest
|
|
18
|
+ pies[0] = min(S[0])
|
|
19
|
+
|
|
20
|
+
|
|
21
|
+ # Next days
|
|
22
|
+ for i in range(1, M):
|
|
23
|
+ day, price = findBest(pies, S)
|
|
24
|
+
|
|
25
|
+
|
|
26
|
+ return 'white'
|
|
27
|
+
|
|
28
|
+if __name__ == "__main__":
|
|
29
|
+ import fileinput
|
|
30
|
+ f = fileinput.input()
|
|
31
|
+
|
|
32
|
+ T = int(f.readline())
|
|
33
|
+ for case in range(1, T+1):
|
|
34
|
+ N, M = [int(i) for i in f.readline().split()]
|
|
35
|
+ S = [[int(i) for i in f.readline().split()] for x in range(N)]
|
|
36
|
+ solution = solve(N, M, S)
|
|
37
|
+ print("Case #{0}: {1}".format(case, solution))
|