CCF—字符串匹配 20140903

#include<iostream>
#include<string>
#include<algorithm>
using namespace std;
int main(){
string s;
cin>>s;
int m,n;
cin>>m>>n;
string str[n], brr[n];
for(int i=0;i<n;i++) {
cin>>str[i];
    brr[i]=str[i];
    }
for(int i=0;i<n;i++){
if(m==1){
if(str[i].find(s)!=string::npos) cout<<str[i]<<endl;
}
else if (m==0){
transform(s.begin(),s.end(),s.begin(),(int (*)(int))toupper);
transform(brr[i].begin(),brr[i].end(),brr[i].begin(),(int (*)(int))toupper);
if(brr[i].find(s)!=string::npos) cout<<str[i]<<endl;
}
}
}