题目链接:传送门(点我)
思路:直接暴力匹配就行了
AC代码
#include<bits/stdc++.h>
using namespace std;
//thinking: Just Brute Force
string s,sub;
int flag,n;
int equal_str(char a,char b)
{
if(flag)return a==b;
return tolower(a)==tolower(b);
}
int BF(string str,string subs)// Brute Force
{
for(int i=0;i<str.length();i++)
for(int j=i,k=0;equal_str(str[j],subs[k]);j++,k++)
if(!subs[k+1])return i;
return -1;
}
int main()
{
cin>>sub>>flag>>n;
cin.ignore();//flush
while(n--){
cin>>s;
if(BF(s,sub)!=-1)cout<<s<<endl;
}
return 0;
}