백준 9996

https://www.acmicpc.net/submit/9996/92889354

 

 

 

#include <iostream>
#include <vector>
using namespace std;

int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cout.tie(NULL);

	int WordsNum;
	string a;
	string Pattern;
	cin >> WordsNum;
	cin >> Pattern;
	vector<string> words;
	for (int i = 0; i < WordsNum; i++)
	{
		cin >> a;
		words.push_back(a);
	}

	// 별표 위치 찾기
	int starPos = Pattern.find('*');
	string PatternFirst = Pattern.substr(0, starPos);
	string PatternLast = Pattern.substr(starPos + 1);

	for (int i = 0; i < words.size(); i++)
	{
		string word = words[i];
		if (word.size() < PatternFirst.size() + PatternLast.size()) {
			cout << "NE" << endl;
			continue;
		}

		if (word.substr(0, PatternFirst.size()) == PatternFirst &&
			word.substr(word.size() - PatternLast.size()) == PatternLast)
		{
			cout << "DA" << endl;
		}
		else
		{
			cout << "NE" << endl;
		}
	}

	return 0;
}