|
||||||||||
ZYB's BiologyTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 1272 Accepted Submission(s): 968 Problem Description After getting $600$ scores in $NOIP$ $ZYB(ZJ-267)$ begins to work with biological questions.Now he give you a simple biological questions: he gives you a $DNA$ sequence and a $RNA$ sequence,then he asks you whether the $DNA$ sequence and the $RNA$ sequence are matched. The $DNA$ sequence is a string consisted of $A,C,G,T$;The $RNA$ sequence is a string consisted of $A,C,G,U$. $DNA$ sequence and $RNA$ sequence are matched if and only if $A$ matches $U$,$T$ matches $A$,$C$ matches $G$,$G$ matches $C$ on each position. Input In the first line there is the testcase $T$. For each teatcase: In the first line there is one number $N$. In the next line there is a string of length $N$,describe the $DNA$ sequence. In the third line there is a string of length $N$,describe the $RNA$ sequence. $1 \leq T \leq 10$,$1 \leq N \leq 100$ Output For each testcase,print $YES$ or $NO$,describe whether the two arrays are matched. Sample Input
Sample Output
Source | ||||||||||
|