sicily 1035. DNA matching

题意：判断基因链是否匹配,匹配的双链数加1,并要标记,下次比较不能重用！

解法： 打擂台法

 #include<iostream>
 #include<string>
 #include<vector>
 #include<cmath>
 using namespace std;

 bool compute(string s1, string s2){
     if(s1.length() != s2.length())
         return false;
     bool flag = false;
     for(int i=;i<s1.length();i++){
         flag =(abs(s1[i]-s2[i]) ==  || abs(s1[i]-s2[i]) == );
         if(!flag)
             break;
     }
     return flag;
 }
 vector<string> strands;

 int main(){
     int caseNums;
     cin >> caseNums;
     while(caseNums--){
         int rows;
         string temp;
         int result =;

         cin >> rows;
         strands.resize(rows);
         strands.clear();
         for(int i=;i<=rows;i++){
             cin >> temp;
             strands.push_back(temp);
         }

         for(int i=;i<strands.size();i++){
             if(strands[i] =="")
                 continue;
             for(int j=i+;j<strands.size();j++){
                 if(strands[j]=="")
                     continue;
                 if(compute(strands[i],strands[j]))
                 {
                     strands[i] ="";
                     strands[j] ="";
                     result++;
                     break;
                 }
             }
         }
         cout<<result<<endl;
     }
     return ;
 }