Message Flood sdutoj 1500 (STL map 的使用)
来源:互联网 发布:广东省网络作家协会 编辑:程序博客网 时间:2024/05/21 00:52
Message Flood
Time Limit: 1500MSMemory Limit: 65536KB
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 3InkfishHenryCarpMaxJerichoCarpMaxCarp0
Example Output
3
///map 大致理解为二维数组#include <bits/stdc++.h>using namespace std;int main(){ int n,m; int i,j; while (cin>>n&&n) { cin>>m; map<string,int>mp; /// 初始时 int / string(second)==0 / '\0', string s; for (i=1; i<=n; i++) { cin>>s; for (j=0; j<s.size(); j++) { s[j]=towlower(s[j]);/// towlower()转换为小写字母 } mp[s]++; } for (i=1; i<=m; i++) { cin>>s; for (j=0; j<s.size(); j++) { s[j]=towlower(s[j]); } mp.erase(s);///删除s元素 } cout<<mp.size()<<endl; } return 0;}
1 0
- Message Flood sdutoj 1500 (STL map 的使用)
- SDUTOJ 1500 Message Flood 【STL】
- SDUTOJ 1500 ——Message Flood 字典树或map
- 【1500】Message Flood (SDUTOJ)
- SDUTOJ Message Flood (STL容器求解)
- sicily Message Flood STL中set和map的应用
- STL --字典树-- Message Flood-----map
- Message Flood(STL map容器求解)
- sicily 1194 Message Flood (STL的map和set应用练习)
- Message Flood(STL)
- STL--D - Message Flood
- Message Flood《STL》
- NOJ1121 Message Flood STL应用
- Message Flood——MAP
- sdut 1500 Message Flood
- Message Flood SDUT 1500
- sdut 1500 Message Flood
- Message Flood(STL set容器求解)
- gcc 编译出现undefined reference to‘pthread_create’的错误
- 编写高质量代码之读书笔记2
- redis五种运用类型场景
- cortex-m3的中断处理
- Leetcode 70. Climbing Stairs
- Message Flood sdutoj 1500 (STL map 的使用)
- javascript-python-git学习
- 编写高质量代码之读书笔记3
- java基础总结3
- 欢迎使用CSDN-markdown编辑器
- 您不得不知道的一件大事——Internet of things
- 基础类库:包装类
- 292_ActionBar的使用
- 位运算