Write a program that lets you know if you can have a key or not, based on your role at the school.
First ask for the user’s role at the school. They can be a student, administrator, or a teacher. (And remember that capitalization is important! ‘Student’ is not the same as ‘student’.)
Example 1: Administrator or Teacher
For example, if this was the input:
Are you an administrator, teacher, or student?: teacher
This should be the output:
Administrators and teachers get keys!
Example 2: Student
And if this was the input:
Are you an administrator, teacher, or student?: student
This should be the output:
Students do not get keys!
(Note: You should also be able to handle a situation where the user enters a value other than administrator, teacher or student and tell them they must be one of the three choices!)
Example 3: Other
If they input anything else:
Are you an administrator, teacher, or student?: secretary
This should be the output:
You can only be an administrator, teacher, or student!
Ответ:
8
Объяснение:
Заметим, что Д — единственная вершина степени 3, которая связана сразу с двумя вершинами степени 4. Значит, Д соответствует П1. Вершина В — единственная вершина степени 4, которая соединена с двумя вершинами степени 2. Следовательно, В соответствует П2. Вершина Г — единственная вершина степени 4, которая соединена с вершиной В. Значит, вершина Г соответствует П3.
Таким образом, длина дороги из пункта В в пункт Г равна 8.