44 lines
1.1 KiB
Python
44 lines
1.1 KiB
Python
class NoSuchStudentException(Exception):
|
|
pass
|
|
|
|
|
|
class Garden:
|
|
def __init__(self, diagram, students=None):
|
|
rows = diagram.split("\n")
|
|
self.row1 = rows[0]
|
|
self.row2 = rows[1]
|
|
|
|
if students is None:
|
|
self.students = [
|
|
"Alena", "Boris", "Cyril", "Daniel", "Eva", "František",
|
|
"Gitka", "Helena", "Ivana", "Jozef", "Karol", "Ladislav"
|
|
]
|
|
else:
|
|
self.students = sorted(students)
|
|
|
|
self.plant_names = {
|
|
"G": "Tráva",
|
|
"C": "Ďatelina",
|
|
"R": "Reďkovky",
|
|
"V": "Fialky"
|
|
}
|
|
|
|
def plants(self, student):
|
|
if student not in self.students:
|
|
raise NoSuchStudentException()
|
|
|
|
index = self.students.index(student)
|
|
pos = index * 2
|
|
|
|
letters = [
|
|
self.row1[pos],
|
|
self.row1[pos + 1],
|
|
self.row2[pos],
|
|
self.row2[pos + 1]
|
|
]
|
|
|
|
result = []
|
|
for letter in letters:
|
|
result.append(self.plant_names[letter])
|
|
|
|
return result |