BestCoder Round #65 1001 ZYB's Biology HDU5590

ZYB's Biology

                                                           Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others)
                                                                                      Total Submission(s): 522    Accepted Submission(s): 387

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≤T≤10 , 1≤N≤100

 

Output

For each testcase,print  YES  or  NO ,describe whether the two arrays are matched.

 

Sample Input

  
  

   
   2
4
ACGT
UGCA
4
ACGT
ACGU
  
  

 

Sample Output

  
  

   
   YES
NO
  
  

 

Source

BestCoder Round #65

出题人：直接按照题意模拟即可.

#include 
   
   
    
    
#include 
    
    
     
     
#include 
     
     
      
      
using namespace std;
const int N=102;
char a[N],b[N];
int main()
{
    int n,T,i,flag;
    scanf("%d",&T);
    while(T--)
    {
        scanf("%d",&n);
        scanf("%s%s",a,b);
        for(i=0; i