Uva 409 – Excuses, Excuses!
Excuses, Excuses!
Time limit: 3.000 seconds
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 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<stdio.h>#include<string.h>#include<ctype.h>typedef struct{int sort, data;}final;int main(){final H[22];int i, j, len, e, k, keylen, loc, flag, T=0;char keyword[22][22], excuse[22][74], temp[22][74], *str;, &k, &e) != EOF){T++;for(i=0; i<22; ++i){H[i].sort = i, H[i].data = 0;memset(keyword[i], , sizeof(char)*22);memset(excuse[i], , sizeof(char)*74);memset(temp[i], , sizeof(char)*74);}for(i=0; i<k; ++i)scanf(, keyword[i]);getchar();for(i=0; i<e; ++i){fgets(temp[i], 74, stdin);len = strlen(temp[i]);) temp[i][len++] = ;for(j=0; j<len; ++j)if(isalpha(temp[i][j]) && isupper(temp[i][j])) excuse[i][j] = tolower(temp[i][j]);else excuse[i][j] = temp[i][j];for(j=0; j<k; ++j){if((str = strstr(excuse[i], keyword[j])) != NULL){loc = str – excuse[i];keylen = strlen(keyword[j]);if(!loc && !isalpha(excuse[i][keylen])) H[i].data++;else if(!isalpha(excuse[i][loc-1]) && !isalpha(excuse[i][keylen+loc])) H[i].data++;}}}for(i=0; i<e-1; ++i){keylen = 1;for(j=0; j<e-1-i; ++j){if(H[j].data < H[j+1].data){keylen = 0;flag = H[j].sort;H[j].sort = H[j+1].sort;H[j+1].sort = flag;flag = H[j].data;H[j].data = H[j+1].data;H[j+1].data = flag;}}if(keylen) break;}printf(, T);printf(, temp[H[0].sort]);for(i=1; i<e; ++i){, temp[H[i].sort]);else break;}printf();}return 0;}
解题报告：
对于一个excuse，查找里面的keywords用strstr函数，香港服务器，判断此keyword在excuse里前后的位置是怎样的，香港空间，然后进行判断，其实就是让人相信keyword左右两边的字符不是isalpha而已。
痛心的不是WA，网站空间，再多的WA如果值得，为何不可呢？
posted on
人生就是要感受美丽的、善良的，丑恶的、病态的。
