TORONTO KIDS COMPUTER CLUB | Aurora Saturday 14:30 Python Practice 22.03.26.
20486
post-template-default,single,single-post,postid-20486,single-format-standard,ajax_fade,page_not_loaded,,no_animation_on_touch,qode-theme-ver-7.6.2,wpb-js-composer js-comp-ver-6.10.0,vc_responsive

# Aurora Saturday 14:30 Python Practice 22.03.26.

## 30 Mar Aurora Saturday 14:30 Python Practice 22.03.26.

Question:
A Telephone Line Company (TLC) is establishing a new telephone cable network. They are connecting several places numbered by integers from 1 to N . No two places have the same number. The lines are bidirectional and always connect together two places and in each place the lines end in a telephone exchange. There is one telephone exchange in each place. From each place it is possible to reach through lines every other place, however it need not be a direct connection, it can go through several exchanges. From time to time the power supply fails at a place and then the exchange does not operate. The officials from TLC realized that in such a case it can happen that besides the fact that the place with the failure is unreachable, this can also cause that some other places cannot connect to each other. In such a case we will say the place (where the failure occured) is critical. Now the officials are trying to write a program for finding the number of all such critical places. Help them.

Input Specification:
The input file consists of several blocks of lines. Each block describes one network. In the first line of each block there is the number of places N < 100. Each of the next at most N lines contains the number of a place followed by the numbers of some places to which there is a direct line from this place. These at most N lines completely describe the network, i.e., each direct connection of two places in the network is contained at least in one row. All numbers in one line are separated by one space. Each block ends with a line containing just 0. The last block has only one line with N = 0;

Output Specification:
The output contains for each block except the last in the input file one line containing the number of critical places.

`Sample Input:55 1 2 3 4062 1 35 4 6 200Sample Output:12Hint:You need to determine the end of one line. In order to make it's easy to determine, there are no extra blank before the end of each line.Subject to Learn:A vertex in an undirected connected graph is an articulation point (or cut vertex) if removing it (and edges through it) disconnects the graph. Articulation points represent vulnerabilities in a connected network – single points whose failure would split the network into 2 or more components. They are useful for designing reliable networks. Please do some research to find out How to find all articulation points in a given graph.`

##### No Comments

Sorry, the comment form is closed at this time.