sdut map水题
2017-05-24 11:20
120 查看
Message Flood
Time Limit: 1500MS Memory Limit: 65536KB
Submit Statistic Discuss
Problem Description
Well, how do you feel about mobile phone? Your answer would probably be something like that “It’s so convenient and benefits people a lot”. However, If you ask Merlin this question on the New Year’s Eve, he will definitely answer “What a trouble! I have to keep my fingers moving on the phone the whole night, because I have so many greeting message to send!” Yes, Merlin has such a long name list of his friends, and he would like to send a greeting message to each of them. What’s worse, Merlin has another long name list of senders that have sent message to him, and he doesn’t want to send another message to bother them Merlin is so polite that he always replies each message he receives immediately). So, before he begins to send message, he needs to figure to how many friends are left to be sent. Please write a program to help him. Here is something that you should note. First, Merlin’s friend list is not ordered, and each name is alphabetic strings and case insensitive. These names are guaranteed to be not duplicated. Second, some senders may send more than one message to Merlin, therefore the sender list may be duplicated. Third, Merlin is known by so many people, that’s why some message senders are even not included in his friend list.
Input
There are multiple test cases. In each case, at the first line there are two numbers n and m (1<=n,m<=20000), which is the number of friends and the number of messages he has received. And then there are n lines of alphabetic strings(the length of each will be less than 10), indicating the names of Merlin’s friends, one per line. After that there are m lines of alphabetic strings, which are the names of message senders. The input is terminated by n=0.
Output
For each case, print one integer in one line which indicates the number of left friends he must send.
Example Input
5 3
Inkfish
Henry
Carp
Max
Jericho
Carp
Max
Carp
0
Example Output
3
参考文章:http://blog.csdn.net/u010951938/article/details/18358397
Time Limit: 1500MS Memory Limit: 65536KB
Submit Statistic Discuss
Problem Description
Well, how do you feel about mobile phone? Your answer would probably be something like that “It’s so convenient and benefits people a lot”. However, If you ask Merlin this question on the New Year’s Eve, he will definitely answer “What a trouble! I have to keep my fingers moving on the phone the whole night, because I have so many greeting message to send!” Yes, Merlin has such a long name list of his friends, and he would like to send a greeting message to each of them. What’s worse, Merlin has another long name list of senders that have sent message to him, and he doesn’t want to send another message to bother them Merlin is so polite that he always replies each message he receives immediately). So, before he begins to send message, he needs to figure to how many friends are left to be sent. Please write a program to help him. Here is something that you should note. First, Merlin’s friend list is not ordered, and each name is alphabetic strings and case insensitive. These names are guaranteed to be not duplicated. Second, some senders may send more than one message to Merlin, therefore the sender list may be duplicated. Third, Merlin is known by so many people, that’s why some message senders are even not included in his friend list.
Input
There are multiple test cases. In each case, at the first line there are two numbers n and m (1<=n,m<=20000), which is the number of friends and the number of messages he has received. And then there are n lines of alphabetic strings(the length of each will be less than 10), indicating the names of Merlin’s friends, one per line. After that there are m lines of alphabetic strings, which are the names of message senders. The input is terminated by n=0.
Output
For each case, print one integer in one line which indicates the number of left friends he must send.
Example Input
5 3
Inkfish
Henry
Carp
Max
Jericho
Carp
Max
Carp
0
Example Output
3
参考文章:http://blog.csdn.net/u010951938/article/details/18358397
#include<bits/stdc++.h> #include<iostream> using namespace std; int main() { int n,m; while(cin>>m) { if(m==0) break; cin>>n; getchar(); char s[30]; map<string,int>mp; //map<string,int>::iterator it; for(int i=0;i<m;i++) { gets(s); int len = strlen(s); for(int j=0;j<len;j++) { s[j] = tolower(s[j]); } mp[s]++; } for(int i=0;i<n;i++) { gets(s); int len = strlen(s); for(int j=0;j<len;j++) { s[j] = tolower(s[j]); } mp.erase(s); } cout<<mp.size()<<endl; } return 0; }
相关文章推荐
- HDU 1029 某个数出现的次数大于等于(N+1)/2的是哪个 map水题
- Color Me Less (poj 1046) (sdut 1047)水题
- sdut Message Flood(c++ map)
- hdu 5199 map水题
- SDUT 3189 Reverse Rot(水题)
- hdu 1004 颜色与数字(map水题)
- codeforces 637B B. Chat Order(map,水题)
- SDUT 2829 大家快来A水题
- sdut 487-3279【哈希查找,sscanf ,map】
- poj1002(map水题 )
- SDUT 2805 大家快来A水题
- sdut-查找练习 hash——出现过的数字(map容器)
- HDU 4287 Intelligent IME (map水题或字典树+DFS)
- sdut 2163:Identifiers(第二届山东省省赛原题,水题)
- UVa 119|Greedy Gift Givers|STL|map|水题
- HDU 1800 Flying to the Mars map水题
- SDUT-3398 数据结构实验之排序一:一趟快排(水题)
- sdut3252---Lowest Unique Price (map+set维护特定值)
- 【水题】SDUT3035-你猜我猜不猜你猜不猜
- codeforces 659C C. Tanya and Toys(水题+map)