题目链接:http://118.190.20.162/view.page?gpid=T14
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
using namespace std;
string q[101];
int res[101];
int pos;
int main() {
string S;
int flag;
int n;
cin>>S;
cin>>flag;
cin>>n;
for(int i=0;i<n;i++){
cin>>q[i];
}
for(int i=0;i<n;i++){
if(flag==0){
string tmp_s;
string tmp_q;
for(int j=0;j<S.size();j++){
if(S[j]>='A'&&S[j]<='Z'){
tmp_s+=S[j]+32;
}
else
{
tmp_s+=S[j];
}
}
for(int j=0;j<q[i].size();j++){
if(q[i][j]>='A'&&q[i][j]<='Z'){
tmp_q+=q[i][j]+32;
}
else
{
tmp_q+=q[i][j];
}
}
string::size_type idx=tmp_q.find(tmp_s);
if(idx!=string::npos){
res[pos++]=i;
}
}
else
{
string::size_type idx=q[i].find(S);
if(idx!=string::npos){
res[pos++]=i;
}
}
}
for (int k = 0; k <pos ; ++k) {
cout<<q[res[k]]<<endl;
}
return 0;
}