// #pragma optimize ("g",on)
// #pragma GCC optimize ("inline")
// #pragma GCC optimize ("Ofast")
// #pragma GCC optimize ("unroll-loops")
// #pragma GCC optimize ("03")
#include <bits/stdc++.h>
#define SS ios_base::sync_with_stdio(0);cin.tie(nullptr);cout.tie(nullptr);
#define int long long
#define all(v) v.begin(),v.end()
using namespace std;
// mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
const int N = 1e5 + 1, MX = 7e5 + 1, inf = 1e18;
void solve(){
int n, d;
cin >> n >> d;
string s[n];
int ans = 0;
for(int i = 0; i < n; i++){
cin >> s[i];
for(int j = 0; j < i; j++){
int cnt = 0;
for(int k = 0; k < 4; k++){
if(cnt > d) break;
if(s[i][k] != s[j][k]){
cnt++;
}
}
ans += (cnt == d);
}
}
cout << ans << '\n';
}
signed main(){
SS
// freopen("trains.in", "r", stdin);
// freopen("trains.out", "w", stdout);
int t = 1;
// cin >> t;
while(t--){
solve();
}
}
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |