Excuses, Excuses! (map , string )
来源:互联网 发布:江苏院概预算软件 编辑:程序博客网 时间:2024/05/08 19:35
Excuses, Excuses!
Problem Description
Judge Ito is having a problem with people subpoenaed for jury duty giving rather lame excuses in order to avoid serving. In order to reduce the amount of time required listening to goofy excuses, Judge Ito has asked that you write a program that will search for a list of keywords in a list of excuses identifying lame excuses. Keywords can be matched in an excuse regardless of case.
Input
Input to your program will consist of multiple sets of data.
Line 1 of each set will contain exactly two integers. The first number (1 <= K <= 20) defines the number of keywords to be used in the search. The second number (1 <= E <= 20) defines the number of excuses in the set to be searched.
Lines 2 through K+1 each contain exactly one keyword.
Lines K+2 through K+1+E each contain exactly one excuse.
All keywords in the keyword list will contain only contiguous lower case alphabetic characters of length L (1 <= L <= 20) and will occupy columns 1 through L in the input line.
All excuses can contain any upper or lower case alphanumeric character, a space, or any of the following punctuation marks [SPMamp".,!?&] not including the square brackets and will not exceed 70 characters in length.
Excuses will contain at least 1 non-space character.
Line 1 of each set will contain exactly two integers. The first number (1 <= K <= 20) defines the number of keywords to be used in the search. The second number (1 <= E <= 20) defines the number of excuses in the set to be searched.
Lines 2 through K+1 each contain exactly one keyword.
Lines K+2 through K+1+E each contain exactly one excuse.
All keywords in the keyword list will contain only contiguous lower case alphabetic characters of length L (1 <= L <= 20) and will occupy columns 1 through L in the input line.
All excuses can contain any upper or lower case alphanumeric character, a space, or any of the following punctuation marks [SPMamp".,!?&] not including the square brackets and will not exceed 70 characters in length.
Excuses will contain at least 1 non-space character.
Output
For each input set, you are to print the worst excuse(s) from the list.
The worst excuse(s) is/are defined as the excuse(s) which contains the largest number of incidences of keywords.
If a keyword occurs more than once in an excuse, each occurrence is considered a separate incidence.
A keyword ``occurs" in an excuse if and only if it exists in the string in contiguous form and is delimited by the beginning or end of the line or any non-alphabetic character or a space.
For each set of input, you are to print a single line with the number of the set immediately after the string ``Excuse Set #". (See the Sample Output). The following line(s) is/are to contain the worst excuse(s) one per line exactly as read in. If there is more than one worst excuse, you may print them in any order.
After each set of output, you should print a blank line.
The worst excuse(s) is/are defined as the excuse(s) which contains the largest number of incidences of keywords.
If a keyword occurs more than once in an excuse, each occurrence is considered a separate incidence.
A keyword ``occurs" in an excuse if and only if it exists in the string in contiguous form and is delimited by the beginning or end of the line or any non-alphabetic character or a space.
For each set of input, you are to print a single line with the number of the set immediately after the string ``Excuse Set #". (See the Sample Output). The following line(s) is/are to contain the worst excuse(s) one per line exactly as read in. If there is more than one worst excuse, you may print them in any order.
After each set of output, you should print a blank line.
Sample Input
5 3dogatehomeworkcanarydiedMy dog ate my homework.Can you believe my dog died after eating my canary... AND MY HOMEWORK?This excuse is so good that it contain 0 keywords.6 5superhighwaycrazythermonuclearbedroomwarbuildingI am having a superhighway built in my bedroom.I am actually crazy.1234567890.....,,,,,0987654321?????!!!!!!There was a thermonuclear war!I ate my dog, my canary, and my homework ... note outdated keywords?
Sample Output
Excuse Set #1Can you believe my dog died after eating my canary... AND MY HOMEWORK?Excuse Set #2I am having a superhighway built in my bedroom.There was a thermonuclear war!#include<iostream># include<map>#include<cstdio># include<cstring># include<algorithm># include<sstream># include<string># include<cctype>using namespace std;const int maxn=1000;string ch[maxn];string str[maxn];string str1[maxn];int num[maxn];string hh,ww;int main(){ int n,m,maax; int cas=0; while(cin>>n>>m) { map<string,int > ma; ma.clear(); maax=0; memset(num,0,sizeof(num)); for(int i=1;i<=n;i++) { cin>>ch[i]; ma[ch[i]]=1; } getchar(); // 又是这里忘记 getchar 哭晕啊 for(int j=1; j<=m; j++) { getline(cin,str[j]); str1[j]=str[j]; for(int h=0;h<str[j].length();h++) if(isalpha(str[j][h])) str[j][h]=tolower(str[j][h]); //牢记tolower用法 else str[j][h]=' '; stringstream ss(str[j]); while(ss>>hh) { if(ma[hh]==1) num[j]+=1; if(num[j]>maax) maax=num[j]; } } printf("Excuse Set #%d\n",++cas); for(int i=1;i<=m;i++) { if(num[i]==maax&&maax!=0) cout<<str1[i]<<endl; } cout<<endl; } return 0;}
0 0
- Excuses, Excuses! (map , string )
- Hdu Excuses, Excuses! 字符串处理 map应用
- Excuses, Excuses!
- Excuses, Excuses!
- Excuses, Excuses!
- Excuses, Excuses!
- Excuses, Excuses!
- Excuses, Excuses!
- fjnu 1850 Excuses, Excuses!
- UVa 409 Excuses, Excuses!
- 409-Excuses, Excuses!
- 409 - Excuses, Excuses!
- poj1598 Excuses, Excuses!
- uva 409 Excuses, Excuses!
- UVa 409 Excuses! Excuses!
- UVa 409 - Excuses, Excuses!
- uva-409 - Excuses, Excuses!
- uva409 - Excuses, Excuses!
- 类型化与原始数组列表的兼容性
- 生活管家 APP
- Java中数据库连接池原理机制的详细讲解
- Jasmine 部分API说明
- 计算机二级C语言考过了,接下去该学习什么?
- Excuses, Excuses! (map , string )
- UITableView刷新
- hdu 4950
- c++写的discuz<=7.2 SQL注入漏洞,批量注入工具
- 【易微信系列3】神马漂流瓶
- tomcat服务器基础
- JS遍历Json字符串中键值对
- virtualBox虚拟机linux(CentOS)扩容(增加原先设置的大小 扩容至根目录)
- C#综合应用,写一个英语单词类浏览练习软件