section succession is called customary in case it is feasible to acquire right number-crunching articulation by embedding characters + and 1 into this grouping. For instance, successions (())(), () and (()(())) are normal, while )(, (() and (()))( are not. How about we call a normal section succession "RBS". You are given a succession
Correct answer will be upvoted else Multiple Downvoted. Computer science.
section succession is called customary in case it is feasible to acquire right number-crunching articulation by embedding characters + and 1 into this grouping. For instance, successions (())(), () and (()(())) are normal, while )(, (() and (()))( are not. How about we call a normal section succession "RBS".
You are given a succession s of n characters (, ), as well as ?. There is by and large one character ( and precisely one character ) in this succession.
You need to supplant each character ? with either ) or ( (various characters ? can be supplanted with various sections). You can't reorder the characters, eliminate them, embed different characters, and each ? should be supplanted.
Decide whether it is feasible to acquire a RBS after these substitutions.
Input
The main line contains one integer t (1≤t≤1000) — the number of experiments.
Each experiment comprises of one line containing s (2≤|s|≤100) — a succession of characters (, ), or potentially ?. There is actually one character ( and precisely one character ) in this succession.
Output
For each experiment, print YES in case it is feasible to acquire a normal section grouping, or NO otherwise}.
You might print each letter regardless (for instance, YES, Yes, indeed, yEs will be in every way perceived as certain reply).
Step by step
Solved in 4 steps with 1 images
