#P1272F. Two Bracket Sequences
Two Bracket Sequences
No submission language available for this problem.
Description
You are given two bracket sequences (not necessarily regular) and consisting only of characters '(' and ')'. You want to construct the shortest regular bracket sequence that contains both given bracket sequences as subsequences (not necessarily contiguous).
Recall what is the regular bracket sequence:
- () is the regular bracket sequence;
- if is the regular bracket sequence, then () is a regular bracket sequence;
- if and regular bracket sequences, then (concatenation of and ) is a regular bracket sequence.
Recall that the subsequence of the string is such string that can be obtained from by removing some (possibly, zero) amount of characters. For example, "coder", "force", "cf" and "cores" are subsequences of "codeforces", but "fed" and "z" are not.
The first line of the input contains one bracket sequence consisting of no more than characters '(' and ')'.
The second line of the input contains one bracket sequence consisting of no more than characters '(' and ')'.
Print one line — the shortest regular bracket sequence that contains both given bracket sequences as subsequences (not necessarily contiguous). If there are several answers, you can print any.
Input
The first line of the input contains one bracket sequence consisting of no more than characters '(' and ')'.
The second line of the input contains one bracket sequence consisting of no more than characters '(' and ')'.
Output
Print one line — the shortest regular bracket sequence that contains both given bracket sequences as subsequences (not necessarily contiguous). If there are several answers, you can print any.