Automatic Editing



Automatic Editing

UVA 10115

大意：

给一个数字N代表有几组替换方式，将每一个测试的最后一句，以上面给出的替换方式替换

要点：

每成功替换一次，应该从头开始重新匹配

代码：

#include <iostream>#include <string>using namespace std;string rule[15];string replace[15];string str, t;int  rnum;void match(){for (int j = 0; j < rnum; j++){for (int k = 0; k < str.length(); k++){if (str[k] == rule[j][0]){ t = str.substr(k, rule[j].length());int leng = t.length();if (t == rule[j]){ str = str.substr(0, k) + replace[j] + str.substr(k + rule[j].length(), 300); k = 0;}}}}}int main(){int rulenum;while (cin >> rulenum && rulenum){cin.ignore();int n = 0;rnum = rulenum;while (rulenum--){getline(cin, rule[n]);getline(cin, replace[n]);n++;}getline(cin, str);match();cout << str << endl;}}