在改用了set的强大的容器后,这一题轻松地通过了~
代码如下
#include
#include
#include
#include
using namespace std;
string trans(string name) {
int len = name.length();
string result;
for (int i = 0; i < len; i++) {
result.push_back(tolower(name[i]));
}
return result;
}
int main() {
int n, m;
while (cin >> n) {
if (n == 0) break; // The input is terminated by n=0.
cin >> m;
set
message; string name; for (int i = 0; i < n; i++) { cin >> name; message.insert(trans(name)); } // end for for (int j = 0; j < m; j++) { string sender; cin >> sender; message.erase(trans(sender)); } // end for cout << message.size() << endl; // 输出剩余没发过信息的朋友数 message.clear(); } return 0; }