字符串匹配。北航

#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>

using namespace std;

int main(){
    int n;
	string str[1001];
	string a[1001];
	string pipei;
	while(scanf("%d",&n)!=EOF){
		for(int i = 0;i<n;i++){
		   cin>>str[i];
		   a[i] = str[i];//保存
		   for(int j = 0;j<a[i].size();j++)
		   {
			   a[i][j] = towlower(a[i][j]);
		   }
		}
		cin>>pipei;
	    string b = pipei;
        for(int j = 0;j<b.size();j++)
		 {
		   if(b[j]>='A'&&b[j]<='Z')
			   b[j] = b[j]+32;
		  }
	    int start = b.find('[');
		int end = b.find(']');
		string t1 = b.substr(0,start);///'['前的字符串
		string t2 = b.substr(start+1,end-start-1);
	    string t3 = b.substr(end+1);//‘]’后的字符串
		
		for(int j =0;j<t2.size();j++){
		   string res = t1+t2[j]+t3;
		   for(int i = 0;i<n;i++)
		    {
			  if(a[i]==res)
			  {
			     cout<<i+1<<" "<<str[i]<<endl;
				 break;
			  }

		   }
		}
	}
}