UVA 409 Excuses, Excuses! (字符处理)

时间:2014-11-08 07:05:37   收藏:0   阅读:262

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.

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!

找出出现固定单词次数最多的那句话。模拟即可。注意比较的时候不区分大小写。

<pre name="code" class="cpp">#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<deque>
typedef long long LL;
using namespace std;
#define REPF( i , a , b ) for ( int i = a ; i <= b ; ++ i )
#define REP( i , n ) for ( int i = 0 ; i < n ; ++ i )
#define CLEAR( a , x ) memset ( a , x , sizeof a )
char str[1500][1000],s[100][100];
char w[100][100];
int num[100];
int K,E;

int main()
{
    int cas=1;
    while(~scanf("%d%d",&K,&E))
    {
        getchar();
        CLEAR(num,0);
        REP(i,K)
           scanf("%s",w[i]);
        int mm=0;
        getchar();
        REP(i,E)
        {
            char st[1500];
            gets(str[i]);
            strcpy(st,str[i]);
            int len=strlen(st);
            REP(j,len)
               st[j]=tolower(st[j]);
 //           cout<<st<<endl;
            REP(j,K)//¶Ôµ¥´Ê
            {
                for(int x=0;x<len;x++)
                {
                    int flag=1,l;
                    if(st[x]==w[j][0])
                    {
                        for(l=0;l<strlen(w[j]);l++)
                        {
                            if(st[x+l]!=w[j][l])
                            {
                                flag=0;
                                break;
                            }
                        }
                        if(flag&&((!isalpha(st[x+l])&&(x-l<0))||
                                  !(isalpha(st[x+l])||isalpha(st[x-1]))))
                            num[i]++;
                    }
                }
                mm=max(mm,num[i]);
            }
        }
        printf("Excuse Set #%d\n",cas++);
        REP(i,E)
          if(mm==num[i])
             puts(str[i]);
        puts("");
    }
    return 0;
}


原文:http://blog.csdn.net/u013582254/article/details/40915293

评论(0
© 2014 bubuko.com 版权所有 - 联系我们:wmxa8@hotmail.com
打开技术之扣,分享程序人生!