Message Flood(STL)
来源:互联网 发布:访客网络怎么隐藏 编辑:程序博客网 时间:2024/05/22 00:34
Message FloodCrawling in process...Crawling failedTime Limit:1500MS Memory Limit:65536KB 64bit IO Format:%lld & %llu
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.
Sample Input
5 3InkfishHenryCarpMaxJerichoCarpMaxCarp0
Sample Output
3
题意 :第一行前一个数指未发短信的人数,后一个指给本人发短信的人数,给本人发过短信的就不需要再给那个人发,求还需要再发几个人;
#include <stdio.h>#include <string.h>#include <stdlib.h>#include <map>#include <string>#include <algorithm>#include <iostream>using namespace std;int main(){ char str[20]; int n,m,i,j,k; int len; map<string,int>G;//为map申请内存; while(~scanf("%d",&n)) { if(n==0) break; G.clear();//初始化,必须加这一步; scanf("%d",&m); for(i=0;i<n;i++) { scanf("%s",&str); len=strlen(str); for(j=0;j<len;j++) if(str[j]>='a'&&str[j]<='z') str[j]-=32;//与大小写无关,可以统一换为大写或小写; G[str]=1; } for(i=0;i<m;i++) { scanf("%s",str); len=strlen(str); for(j=0;j<len;j++) if(str[j]>='a'&&str[j]<='z') str[j]-=32;//同上 if(G[str]==1) { n--; G[str]=0; } } printf("%d\n",n); } 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(字典树)
- 【1500】Message Flood (SDUTOJ)
- Message Flood(字典数)
- Message Flood(字典树)
- sicily 1194 Message Flood (STL的map和set应用练习)
- Message Flood
- Message Flood
- Message Flood
- Message Flood
- C语言 编译、链接、全局变量
- 解决安装Ubuntu之后找不到无线网卡驱动的问题
- java synchronized详解
- DOM4J乱码问题
- HDU 1677Nested Dolls
- Message Flood(STL)
- Activity生命周期状态
- SQL server2005服务器登录名、角色、数据库用户、角色、架构的关系
- 使用libjpeg 压缩yuv420到jpg (内存方式)
- Android中dispatchTouchEvent, onInterceptTouchEvent, onTouchEvent浅谈
- hdu4908 & BestCoder Round #3 BestCoder Sequence(组合数学)
- 刚写的 软件 求大家评论一下 看看 效果 后期抽空写个软件的教程
- 解決 SQL Server 檢視表 (Views) 無法匯入 EDMX 的問題
- Hibernate_1_环境的配置