### -B1nary-'s blog

By -B1nary-, history, 13 months ago,

Hello, I was solving some classical problems in UVA, now I am stuck on this task.

315 Network

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 occurred) is critical. Now the officials are trying to
write a program for finding the number of all such critical places. Help them.

Input
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
The output contains for each block except the last in the input file one line containing the number of
critical places.

Sample Input
5
5 1 2 3 4
0
6
2 1 3
5 4 6 2
0
0

Sample Output
1
2


I know that we need to count the number of articulation points and report it. But before that, I didn't even understand how to take the input. So can anyone help me by giving some advice on input and output formatting not only for this task but in general?

I am sorry if the problem statement is not readable. I don't know how to post a task as others do.

• 0

 » 13 months ago, # | ← Rev. 4 →   0 You may do something like the following: int n; while(cin >> n && n) { cin.get(); //To remove '\n' left by cin >> n. string s; getline(cin, s); while(s[0] != '0') { stringstream ss(s); int k; ss >> k; int j; while(ss >> j) { } getline(cin, s); } } An alternate way is the following: int n; while(cin >> n && n) { cin.get(); //To remove '\n' left by cin >> n. string s; getline(cin, s); while(1) { stringstream ss(s); int k; ss >> k; if(!k) break; int j; while(ss >> j) { } getline(cin, s); } } 
•  » » 13 months ago, # ^ | ← Rev. 2 →   0 Thanks for your reply. Inside the third while loop, we are not given that there will be exactly k inputs.
•  » » 13 months ago, # ^ |   0 I got it just now, we need to take the whole line in a string and then parse the string accordingly. Thanks.