Sicily Message Flood
2016-12-22 21:39
246 查看
记得之前有一题学习到了用map,对这类题目的确十分管用
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 messages 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 messages,
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.
Sample Input
Copy sample input to clipboard
5 3InkfishHenryCarpMaxJerichoCarpMaxCarp0
Sample Output
3
#include<iostream>
#include<string.h>
#include<ctype.h>
#include<map>
using namespace std;
int main()
{
int m,n;
scanf("%d",&m);
while(m!=0)
{
scanf("%d",&n);
string str;
map<string,int> fri;
for(int i = 0;i<m;i++)
{
cin>>str;
for(int j = 0;j<str.length();j++)
str[j] = tolower(str[j]);
fri[str] = 1;
}
for(int i = 0;i<n;i++)//input sent
{
cin>>str;
for(int j = 0;j<str.length();j++)
str[j] = tolower(str[j]);
if(fri.count(str)==1)
fri[str] = 0;
}
map<string,int>::iterator it;
int test =0;
for( it = fri.begin();it!=fri.end();++it)
{
if(it->second==1)
test++;
}
cout<<test<<endl;
scanf("%d",&m);
}
return 0;
}
相关文章推荐
- sicily message flood
- Message Flood SDUT
- sicily 1754 逃离洞穴(BFS+FloodFill)
- 1194. Message Flood
- SDUTOJ Message Flood (STL容器求解)
- Message Flood
- 1003. Message Flood
- Message Flood——map初级应用
- sdut Message Flood(c++ map)
- trie树Message Flood
- Message Flood 【排序--二分查找】
- Resolving “nf_conntrack: table full, dropping packet.” flood message in dmesg Linux kernel log
- 1194. Message Flood
- Message Flood sdutoj 1500 (STL map 的使用)
- message_flood
- Sicily 1938. Message Flood
- sdut Message Flood
- Message Flood——MAP
- Message 消息处理详解
- Sicily 4839. 铺地毯