## Problem J5/S3: Strategic Bombing

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.

### Input

In the input, each point is identified by a single upper-case letter (there are a maximum of 26 points). 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.

### Output

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 n is the number of such roads.

If there is no such road, output "There are 0 disconnecting roads."

### Sample Input

```ACADAECECFEDGFBGHBGH**
```

### Sample Output

```CFGFThere are 2 disconnecting roads.
```

Point Value: 10
Time Limit: 2.00s
Memory Limit: 16M

Problem Types: [Show]

Languages Allowed:
C++03, PAS, C, HASK, ASM, RUBY, PYTH2, JAVA, PHP, SCM, CAML, PERL, C#, C++11, PYTH3

• (2/3)

• (3/2)

• (0/0)

• (0/0)

• (0/0)
Why is it only 2? Can't AC and BG be blown up as well?

• (0/0)
If you blow up AC, you can still get from A to B:

A->E->C->F->G->B

• (1/2)
do the roads need to be outputted in the order that they were inputted?

• (2/1)
Does the problem say they need to be outputted in any specific order?

• (0/1)
and the other half have 7, like ross and toby

• (1/1)
CCC01J5S3 - Strategic Bombing (30 / 30) <-- Toby

Ross has 7 because he did it before the CCC 30 pointer thing was started. You don't get more.

Chris is the new care bear =) I kid I kid.

• (0/0)
but if the problem didnt get any harder, the why doesnt ross get his 23 points

• (0/1)
the 30 pt deal doesn't apply to problems that you've fully solved already.

• (1/1)
well it should