//Beiba.cpp rulit!
#include <bits/stdc++.h>
using namespace std;
#define open freopen ("sum.in","r",stdin), freopen ("sum.out","w",stdout);
#define nl '\n'
#define ll long long int
#define pb push_back
#define sz size()
#define all(x) x.begin(), x.end()
#define S second
#define F first
#define co continue
#define NO cout<<"NO"<<nl
#define YES cout<<"YES"<<nl
#define No cout<<"No"<<nl
#define Yes cout<<"Yes"<<nl
#define rt return
#define str string
#define pot fixed<<setprecision
#define int ll
#define pi pair<int,int>
#define vi vector
#define MAI INT64_MAX
#define MII INT64_MIN
const int inf=1e18, mod=1e9+7, N=5e4+7;
int n,d,ans;
str s[N];
void ibrosh_abi(){
cin>>n>>d;
for(int i=1; i<=n; i++){
cin>>s[i];
for(int j=1; j<i; j++){
str x=s[i],y=s[j];
int dada=0;
if(x[0]!=y[0]) dada++;
if(x[1]!=y[1]) dada++;
if(x[2]!=y[2]) dada++;
if(x[3]!=y[3]) dada++;
if(dada==d) ans++;
}
}
cout<<ans<<nl;
}
signed main(){
ios_base::sync_with_stdio(false); cin.tie(0);
//open
int tt=1,cas=1;
//cin>>tt;
while(tt--){
//cout<<"Case "<<cas++<<": ";
ibrosh_abi();
}
}
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |