Data Structures contest
The cow cotillion, a fancy dance every spring, requires the cows (shown as ">") and bulls (shown as "<") to bow to each other during a dance. Schematically, one properly bowing pair of cattle is shown like this: "><". Sometimes another pair of cattle will sashay between a pair of bowing cows: "> >< <".
In fact, sometimes a larger number of cows will mix it up on the dance floor: "> >< < ><" (this includes a second set of bowing cows on the right). Complex arrangements can be perfectly legal dance formations:
Farmer John notices that a stray heifer sometimes sneaks into a group and unbalances it: "> >< < <> <". This is strictly forbidden; FJ wants to punish the interlopers.
FJ has copied down records of as many as 500 cows participating in dance lines and wonders if the dance line is properly balanced (i.e., all of the cattle can be paired off in at least one way as properly bowing pair by pair). He copied only the direction each cow was bowing without any extra spaces to help determine which cow was bowing to which bull, strings like this rendition of the illegal example from the previous paragraph: ">><<<><". He wants you to write a program to tell him if the dance line is legal.
FJ has n pattern recordings
Pi comprising just the characters '>' and '<' with varying length
Ki (1 ≤
Ki ≤ 200). Print "legal" for those patterns that include proper pairs of bowing cows and "illegal" for those that don't.
First line contains single number n (1 ≤ n ≤ 1000). Each of the next n lines contains an integer followed by a space and a string of K characters '>' and '<':
Each line must contain either the word "legal" or "illegal" depending on whether the corresponding input has a legal bowing configuration.
2 6 >><<>< 4 ><<>