sicily 1035. DNA matching

#include<iostream>
#include<string>
#include<cstring>
using namespace std;
int main(){
	char DNA[130];
	string str[110];
	bool used[100];
	DNA['A'] = 'T';
	DNA['T'] = 'A';
	DNA['C'] = 'G';
	DNA['G'] = 'C';
	int T,n;
	cin>>T;
	while(T--){
		int count=0;
		memset(used,1,sizeof(used));
		cin>>n;
		for(int i=0;i<n;++i)
			cin>>str[i];
		for(int i=0;i<n;++i){
			for(int j=i+1;j<n;++j){
				bool match = 1;
				int n1 = str[i].size();
				int n2 = str[j].size();
				if(n1!=n2||!used[j]||!used[i]) match = 0;
				else {
					for(int k=0;k<n1;++k){
						if(DNA[str[i][k]]!=str[j][k]){
							match = 0;
							break;
						}
					}
				}
				if(match){
					count ++;
					used[i]=0;
					used[j]=0;
					break;
				}
			}
		}
		cout<<count<<endl;
	}
	return 0;
}