1052 卖个萌 题解（字符串处理&&模拟）

PAT (Basic Level) Practice （中文）

#include<bits/stdc++.h>
using namespace std;
vector<string> hem[4];
void process(int id,string s)
{//每次都要从下一个位置开始找起，为+1方便，均初始化为-1 
	int i=-1,j=0;int t=s.size();
	while(j<t){
		i=s.find('[',i+1);
		j=s.find(']',j+1);
		if(i!=-1){
			hem[id].push_back(s.substr(i+1,j-i-1));
		}else{
			return;
		}		
	}
}
int main(){
	string s;
	for(int i=0;i<3;i++){
		getline(cin,s);
		process(i,s);
	}
	int k;cin>>k;
	for(int i=0;i<k;i++){
		string res;int a,b,c,d,e;cin>>a>>b>>c>>d>>e;a--,b--,c--,d--,e--;
		if(a>=hem[0].size()){
			cout<<"Are you kidding me? @\\/@\n";continue;
		}else{
			res+=hem[0][a];
		}
		res+='(';
		if(b>=hem[1].size()){
			cout<<"Are you kidding me? @\\/@\n";continue;
		}else{
			res+=hem[1][b];
		}
		if(c>=hem[2].size()){
			cout<<"Are you kidding me? @\\/@\n";continue;
		}else{
			res+=hem[2][c];
		}
		if(d>=hem[1].size()){
			cout<<"Are you kidding me? @\\/@\n";continue;
		}else{
			res+=hem[1][d];
		}
		res+=')';
		if(e>=hem[0].size()){
			cout<<"Are you kidding me? @\\/@\n";continue;
		}else{
			res+=hem[0][e];
		}
		cout<<res<<endl;
	}
	return 0;
}