Find regular bracket subsequences, ignoring any other characters and single brackets

Cost: $8|$ Solved: $0$

Memory limit: $256$ Mb

Time limit: $1000$ ms

Input file: stdin

Output file: stdout Task:

You are given a set of strings separated with line feed characters.

Find all their regular bracket subsequences.

A regular bracket sequence is a bracket sequence defined by the following rules:

$($an empty string$)$ is a regular bracket sequence;

Let $S$ be a regular bracket sequence, then $($S$)$ and $\{S\}$ are also regular bracket sequences;

Let $S1$ and $S2$ be regular bracket sequences, then $S1S2$ is also a regular bracket sequence;

subsequences can not start or end with them.

Input:

A set of strings separated with line feed characters.

Output:

All the longest correct substrings in the order in which they appear in the text, separating each with a line feed character.

$**$ Use C$++$ only $**$