Koyomi has recently gotten the three brief strings from the challenge coordinators. Assist her with composing a substantial novel for the challenge. A string a will be an aftereffect of a string b if a can be acquired from b by erasure of a few (perhaps, zero) characters. Input
Correct answer will be upvoted else downvoted. Computer science.
Koyomi has recently gotten the three brief strings from the challenge coordinators. Assist her with composing a substantial novel for the challenge.
A string a will be an aftereffect of a string b if a can be acquired from b by erasure of a few (perhaps, zero) characters.
Input
The principal line contains a solitary integer t (1≤t≤104) — the number of experiments.
The principal line of each experiment contains a solitary integer n (1≤n≤105).
Every one of the accompanying three lines contains a bitstring of length 2n. It is ensured that these three strings are pairwise unmistakable.
It is ensured that the amount of n across all experiments doesn't surpass 105.
Output
For each experiment, print a solitary line containing a bitstring of length at most 3n that has somewhere around two of the given bitstrings as aftereffects.
It very well may be demonstrated that under the imperatives of the issue, such a bitstring consistently exists
Step by step
Solved in 3 steps with 1 images
