L - Regular Bracket Sequence CodeForces - 1469A
Problem Description
A bracket sequence is called regular if it is possible to obtain correct arithmetic expression by inserting characters + and 1 into this sequence. For example, sequences (())(), () and (()(())) are regular, while )(, (() and (()))( are not. Let’s call a regular bracket sequence “RBS”.
You are given a sequence s of n characters (, ), and/or ?. There is exactly one character ( and exactly one character ) in this sequence.
You have to replace every character ? with either ) or ( (different characters ? can be replaced with different brackets). You cannot reorder the characters, remove them, insert other characters, and each ? must be replaced.
Determine if it is possible to obtain an RBS after these replacements.
Input
The first line contains one integer t (1≤t≤1000) — the number of test cases.
Each test case consists of one line containing s (2≤|s|≤100) — a sequence of characters (, ), and/or ?. There is exactly one character ( and exactly one character ) in this sequence.
Output
For each test case, print YES if it is possible to obtain a regular bracket sequence, or NO otherwise}.
You may print each letter in any case (for example, YES, Yes, yes, yEs will all be recognized as positive answer).
Example
Input
5
()
(?)
(??)
??()
)?(?
Output
YES
NO
YES
YES
NO
Note
In the first test case, the sequence is already an RBS.
In the third test case, you can obtain an RBS as follows: ()() or (()).
In the fourth test case, you can obtain an RBS as follows: ()().
**解题思路:**只要字符串长度为偶数,或者第一个字符不等于‘ )’,最后一个字符不等于‘( ’,就输出YES,否则输出NO,就OK啦
#include<stdio.h>
#include<string.h>
int main()
{ int n;
scanf("%d",&n);
getchar();
while(n--)
{
char a[1000000];
scanf("%s",a);
if(a[0]!=')'&&a[strlen(a)-1]!='('&&strlen(a)%2==0)
{
printf("YES\n");//或者puts(YES);
}
else
printf("NO\n");
}
return 0;
}