##### Canadian Computing Competition: 2000 Stage 2, Day 1, Problem 1

In this problem, you will write a program to find the minimal solution to a set of set inequalities. A set inequality has the format `X contains S`

where may be any set name and may be a set name or set element. If is a set name the inequality means that is a superset or equal to . If is an element the inequality means that contains . Sets are named - and contain elements from -.

The first line of input specifies the number of set inequalities (). The next lines each contain one set inequality. For each set name that appears in the input, your program must determine its minimal set: the smallest set of elements that the name must take in order that all of the inequalities hold. Output, in alphabetical order, each set name followed its minimal set, with the elements in alphabetical order, in the format shown below.

#### Sample Input

```
9
A contains B
A contains c
B contains d
F contains A
F contains z
X contains Y
Y contains X
X contains x
Q contains R
```

#### Sample Output

```
A = {c,d}
B = {d}
F = {c,d,z}
Q = {}
R = {}
X = {x}
Y = {x}
```

## Comments

What is the maximum of N in this question?

edit: The maximum of N ended up being irrelavent in my solution anyway :p

When I submit my code in python2, it only scores 4/5, however, when I submit the same code in pypy2, I receive AC. If this isn't odd enough, the versions of python are both 2.7.13

Could someone please tell me what is going on?

Is my TLE for the last case because of an infinite loop or is my algorithm too slow?

Is it guaranteed the sets won't be cyclic? i.e; if A contains B can B contain A

No. They can be cyclic.

https://dmoj.ca/problem/vmss7wc15c5p2

When will judging be available for this problem?

Judges are back up.