Canadian Computing Competition: 2001 Stage 1, Junior #5, Senior #3
The Enemy relies heavily on the transportation of supplies and personnel between the specific points A and B. Points A and B, as well as other points C, D, E, etc. are linked by a network of roads. Your mission, should you accept it, is to identify a single road that may be bombed in order to cut off all traffic between A and B.
In the input, each point is identified by a single upper-case letter (there is a maximum of 26). Each line of input identifies a pair of points connected by a road. The end of input is indicated by a line containing
**. All roads are two-way, that is, road AC is the same as road CA. There is at most one road between any pair of points.
Your output should identify all roads such that bombing any one of them would halt all traffic between A and B. Your output should list the roads, one per line, followed by a line stating that
There are n disconnecting roads., where is the number of such roads. If there is no such road, output
There are 0 disconnecting roads..
AC AD AE CE CF ED GF BG HB GH **
CF GF There are 2 disconnecting roads.
I got all AC although my code has problems
Can anyone tell whats the issue with my code? I am getting WA on test case #2 and test case #5.
(Edit: Nvm I figured it out, it was an issue with my loop and repetition)
I forgot one period lmao...
I love it how this was a 2001 problem
The last sentence must end with a new line. Otherwise, you will get WA and not presentation error.
If I print FC instead of CF. Would that still be correct?
But the road to AC involves WA, TLE, IR, MLE, and last but not least, IE!
I'm in the same room as you.
What are the limits on the lines of input?