B. Hyperset(思维+暴力)

https://codeforces.com/contest/1287/problem/B

---

思路：得知三个串搞定两个最后一个答案就确定了，于是map里算完发现C(2,3)每次是算了3次。

#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=2e3;
typedef long long LL;
inline LL read(){LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
map<string,LL>map1;
string str[maxn];
int main(void){
   cin.tie(0);std::ios::sync_with_stdio(false);
   LL n,k;cin>>n>>k;
   for(LL i=1;i<=n;i++) cin>>str[i],map1[str[i]]++;
   LL ans=0;
   for(LL i=1;i<=n;i++){
       for(LL j=i+1;j<=n;j++){
           string tmp="";
           for(LL p=0;p<k;p++){
               if(str[i][p]==str[j][p]) tmp+=str[i][p];
               else if(str[i][p]=='S'&&str[j][p]=='E') tmp+='T';
               else if(str[i][p]=='E'&&str[j][p]=='S') tmp+='T';
               else if(str[i][p]=='E'&&str[j][p]=='T') tmp+='S';
               else if(str[i][p]=='T'&&str[j][p]=='E') tmp+='S';
               else if(str[i][p]=='S'&&str[j][p]=='T') tmp+='E';
               else if(str[i][p]=='T'&&str[j][p]=='S') tmp+='E';

           }
           ans+=map1[tmp];
       }
   }
   cout<<(ans/3)<<"\n";
   return 0;
}