This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
int n,k;
string s[1005];
int get(string a,string b)
{
int m=0;
for (int i=0;i<n;i++)
m+=(a[i]==b[i]);
return min(m,n-m);
}
int main()
{
cin >> n >> k;
for (int i=0;i<n;i++)
cin >> s[i];
for (int i=0;i<n;i++)
k-=get(s[0],s[i]);
if (k>=0)
cout << "DA";
else
cout << "NE";
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |