直接枚举哪一位不同,删去这一位,排序算一下贡献即可。
#include <cstdio>
#include <cstring>
#include <queue>
#include <algorithm>
#include <cmath>
using namespace std;
#define ull unsigned long long
#define inf 0x3f3f3f3f
#define N 30010
#define k1 233
inline int read(){
int x=0,f=1;char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
while(ch>='0'&&ch<='9') x=x*10+ch-'0',ch=getchar();
return x*f;
}
int n,m,ans=0;ull hs[N],bin[210],a[N];
char s[N][210];
inline void calc(int x){
for(int i=1;i<=n;++i) a[i]=hs[i]-s[i][x]*bin[m-x];
sort(a+1,a+n+1);int cnt=0;
for(int i=1;i<=n;++i){
if(i==1||a[i]!=a[i-1]) cnt=0;
else cnt++;ans+=cnt;
}
}
int main(){
// freopen("a.in","r",stdin);
n=read();m=read();int ofo=read();bin[0]=1;
for(int i=1;i<=n;++i){
scanf("%s",s[i]+1);
for(int j=1;j<=m;++j) hs[i]=hs[i]*k1+s[i][j];
}for(int i=1;i<=m;++i) bin[i]=bin[i-1]*k1;
for(int i=1;i<=m;++i) calc(i);
printf("%d\n",ans);
return 0;
}