The 5th Zhejiang Provincial Collegiate Programming Contest------ProblemK：Kinds of Fuwas

#include<bits/stdc++.h>
using namespace std;

char aa[521][521],bb[5]= {'B','J','H','Y','N'};
int main() {
int t,n,m;
int i,j,k,l,s,ss;
cin>>t;
while(t--) {
cin>>n>>m;
for(int =0; i<n; i++)
cin>>aa[i];
ss=0;

for(l=0; l<5; l++) {//检查每一个福娃
for(i=0; i<n; i++) {
for(j=i+1; j<n; j++) {
s=0;
for(k=0; k<m; k++) {//检查两列中是否有相同的
if(a[i][k]==a[j][k]&&a[i][k]==bb[l])
s++;
}
}
ss+=s*(s-1)/2;//s个相同的能有s*(s-1)/2个矩阵
}
}
cout<<ss<<endl;
}
return 0;

}