Message Flood《STL》
来源:互联网 发布:知乎 朝鲜军事 编辑:程序博客网 时间:2024/06/14 07:54
Message Flood
Time Limit: 1500ms Memory limit: 65536K 有疑问?点这里^_^
题目描述
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.
输入
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.
输出
For each case, print one integer in one line which indicates the number of left friends he must send.
示例输入
5 3InkfishHenryCarpMaxJerichoCarpMaxCarp0
示例输出
3
来源
第9届中山大学程序设计竞赛预选赛
- #include<stdio.h>
- #include<iostream>
- #include<map>
- #include<stdlib.h>
- #include<string.h>
- using namespace std;
- int main()
- {
- int n,m,i,j;
- char a[11],b[11];
- while(scanf("%d",&n)!=EOF)
- {
- int sum = 0;
- if(n == 0)
- {
- break;
- }
- scanf("%d",&m);
- map<string,int>p;
- map<string,int>::iterator it;
- getchar();
- for(i=0;i<n;i++)
- {
- //printf("i = %d\n",i);
- gets(a);
- int k;
- k = strlen(a);
- for(j=0;j<k;j++)
- {
- if(a[j]>='A' && a[j]<='Z')
- {
- a[j] = a[j]+32;
- }
- }
- p[a]++;
- }
- //printf("n = %d m = %d\n",n,m);
- for(i=0;i<m;i++)
- {
- gets(b);
- int kk;
- kk = strlen(b);
- for(j=0;j<kk;j++)
- {
- if(b[j]>='A' && b[j]<='Z')
- {
- b[j] = b[j]+32;
- }
- }
- p.erase(b);
- }
- sum = p.size();
- printf("%d\n",sum);
- }
- return 0;
- }
0 0
- Message Flood(STL)
- STL--D - Message Flood
- Message Flood《STL》
- SDUTOJ 1500 Message Flood 【STL】
- NOJ1121 Message Flood STL应用
- STL --字典树-- Message Flood-----map
- Message Flood(STL map容器求解)
- Message Flood(STL set容器求解)
- SDUTOJ Message Flood (STL容器求解)
- Message Flood
- Message Flood
- Message Flood
- Message Flood
- Message Flood
- Message Flood
- Message Flood
- Message Flood
- Message Flood
- CentOS 6.5 Varnish缓存服务详解及应用实现
- 最小生成树,转别人的
- 杭电1421 搬寝室(dp)
- C# winForm启动最小化到任务栏右侧通知栏并交互操作
- 算法笔记---最短路径之bellman-ford算法
- Message Flood《STL》
- PHP实现验证码
- leetcode Merge Sorted Array
- Message Flood《字典树》
- 已经写了好久了,都快要忘记啦
- 排序算法集合(含代码)
- 孙鑫C++教程笔记04
- UNIX网络编程卷1 回射客户程序 TCP客户程序设计范式
- uva1451 - Average(数形结合)