-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathexplore.py
153 lines (127 loc) · 3.61 KB
/
explore.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
from solve import parseINPUT
import numpy as np
def b_problem():
input = parseINPUT("b_read_on.txt")
B_value = input["valueOFbook"]
M = input["numOFbooksSHIPPED"]
for value in B_value:
assert value == 100
for value in M:
assert value == 1
def c_problem():
input = parseINPUT("c_incunabula.txt")
N_n, M = input["numOFbooksINlib"], input["numOFbooksSHIPPED"]
for i in range(len(N_n)):
assert N_n[i] < M[i]
print("Sum of N_n is %d" % (np.sum(N_n)))
B_value = input["valueOFbook"]
N = input["booksINlib"]
book_time_dic = {}
for lib in N:
for book in lib:
if book in book_time_dic:
book_time_dic[book] += 1
else:
book_time_dic[book] = 1
bucks = {}
sum_1 = 0
for book in book_time_dic:
value = book_time_dic[book]
if value in bucks:
bucks[value] += 1
else:
bucks[value] = 1
if value == 1:
sum_1 += B_value[book]
print("bucks of book exist: ")
print(bucks)
print(sum_1)
def d_problem():
input = parseINPUT("d_tough_choices.txt")
B, L, D, B_value, N, T, M, N_n = input.values()
for value in B_value:
assert value == 65
for n in N_n:
assert n <= 14
for t in T:
assert t == 2
for m in M:
assert m == 1
print(np.sum(N_n))
book_time_dic = {}
for lib in N:
for book in lib:
if book in book_time_dic:
book_time_dic[book] += 1
else:
book_time_dic[book] = 1
bucks = {}
for book in book_time_dic:
value = book_time_dic[book]
if value in bucks:
bucks[value] += 1
else:
bucks[value] = 1
print("bucks of book exist: ")
print(bucks)
N_n_bucks = {}
for value in N_n:
if value in N_n_bucks:
N_n_bucks[value] += 1
else:
N_n_bucks[value] = 1
print("bucks of N_n value: ")
print(N_n_bucks)
time_list = []
for lib in N:
time = 0
for book in lib:
if book_time_dic[book] == 2:
time += 1
time_list.append(time)
time_bucks = {}
for value in time_list:
if value in time_bucks:
time_bucks[value] += 1
else:
time_bucks[value] = 1
print("bucks of book time appears value: ")
print(time_bucks)
def e_problem():
input = parseINPUT("e_so_many_books.txt")
B, L, D, B_value, N, T, M, N_n = input.values()
print(np.sum(N_n))
for m in M:
assert m == 1 or m == 2
book_time_dic = {}
for lib in N:
for book in lib:
if book in book_time_dic:
book_time_dic[book] += 1
else:
book_time_dic[book] = 1
bucks = {}
for book in book_time_dic:
value = book_time_dic[book]
if value in bucks:
bucks[value] += 1
else:
bucks[value] = 1
print("bucks of book exist: ")
print(bucks)
def f_problem():
input = parseINPUT("f_libraries_of_the_world.txt")
N_n, M = input["booksINlib"], input["numOFbooksSHIPPED"]
print(np.sum(N_n))
T = input["numOF#Days"]
print("T min is %d" % (np.min(T)))
print("T max is %d" % (np.max(T)))
M = input["numOFbooksSHIPPED"]
print("M min is %d" % (np.min(M)))
print("M max is %d" % (np.max(M)))
B_value = input["valueOFbook"]
print("value min is %d" % (np.min(B_value)))
print("value max is %d" % (np.max(B_value)))
B_value.sort(reverse=True)
print(np.sum(B_value[:12881]))
c_problem()