제출 #199813

#제출 시각아이디문제언어결과실행 시간메모리
199813mohammedehab2002Sajam (COCI18_sajam)C++11
45 / 90
58 ms2268 KiB
#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 timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...