程式師世界 >> 編程語言 >> C語言 >> C++ >> C++入門知識 >> Uva 409-Excuses, Excuses!（串）

Uva 409-Excuses, Excuses!（串）

編輯：C++入門知識

Uva 409-Excuses, Excuses!（串）

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.

SPMamp

Output

For each input set, you are to print the worst excuse(s) from the list.

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 3
dog
ate
homework
canary
died
My 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 5
superhighway
crazy
thermonuclear
bedroom
war
building
I 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 #1
Can you believe my dog died after eating my canary... AND MY HOMEWORK?

Excuse Set #2
I am having a superhighway built in my bedroom.
There was a thermonuclear war!

還是串處理。。

題意：給一個字典，然後給e行串 問哪行串裡面的出現的單詞次數最多，有多個則輸出多個

思路：字典扔set裡。。然後gets成行讀進來轉換成單詞哎個查詢。。然後就完了。。

#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#define ll long long
#define maxn 360
#define pp pair
#define INF 0x3f3f3f3f
#define max(x,y) ( ((x) > (y)) ? (x) : (y) )
#define min(x,y) ( ((x) > (y)) ? (y) : (x) )
using namespace std;
char tem[88],exc[22][77];
int k,e,p,ans[22];
int main()
{
	int cas=1;
	while(~scanf("%d%d",&k,&e))
	{
		getchar();
		memset(ans,0,sizeof(ans));
		string x;set  s;
		while(k--)
		{
			cin>>x;
			s.insert(x);
		}
		getchar();
		for(int i=0;i