pat 1022

1022. Digital Library (30)

时间限制

1000 ms

内存限制

32000 kB

代码长度限制

16000 B

判题程序

Standard

作者

CHEN, Yue

A Digital Library contains millions of books, stored according to their titles, authors, key words of their abstracts, publishers, and published years. Each book is assigned an unique 7-digit number as its ID. Given any query from a reader, you are supposed to output the resulting books, sorted in increasing order of their ID's.

Input Specification:

Each input file contains one test case. For each case, the first line contains a positive integer N (<=10000) which is the total number of books. Then N blocks follow, each contains the information of a book in 6 lines:

• Line #1: the 7-digit ID number;
• Line #2: the book title -- a string of no more than 80 characters;
• Line #3: the author -- a string of no more than 80 characters;
• Line #4: the key words -- each word is a string of no more than 10 characters without any white space, and the keywords are separated by exactly one space;
• Line #5: the publisher -- a string of no more than 80 characters;
• Line #6: the published year -- a 4-digit number which is in the range [1000, 3000].

It is assumed that each book belongs to one author only, and contains no more than 5 key words; there are no more than 1000 distinct key words in total; and there are no more than 1000 distinct publishers.

After the book information, there is a line containing a positive integer M (<=1000) which is the number of user's search queries. Then M lines follow, each in one of the formats shown below:

• 1: a book title
• 2: name of an author
• 3: a key word
• 4: name of a publisher
• 5: a 4-digit number representing the year

Output Specification:

For each query, first print the original query in a line, then output the resulting book ID's in increasing order, each occupying a line. If no book is found, print "Not Found" instead.

Sample Input:

31111111The Testing BookYue Chentest code debug sort keywordsZUCS Print20113333333Another Testing BookYue Chentest code sort keywordsZUCS Print220122222222The Testing BookCYLLkeywords debug bookZUCS Print2201161: The Testing Book2: Yue Chen3: keywords4: ZUCS Print5: 20113: blablabla

Sample Output:

1: The Testing Book111111122222222: Yue Chen111111133333333: keywords1111111222222233333334: ZUCS Print11111115: 2011111111122222223: blablablaNot Found

//挺水的题

#include <stdio.h>#include <string.h>#include <algorithm>using namespace std;struct Book{int ID;char title[120];char author[120];char words[120];char publisher[120];int year;} bk[10010];int num[10010];int n, m;int main(){int i, j, count, l, h;char search[200];while(scanf("%d", &n) != EOF){for(i = 0; i < n; i++){scanf("%d", &bk[i].ID);getchar();gets(bk[i].title);gets(bk[i].author);gets(bk[i].words);gets(bk[i].publisher);scanf("%d", &bk[i].year);}memset(num, 0, sizeof(num));scanf("%d", &m);getchar();for(i = 0; i < m; i++){count = 0;gets(search);int id = search[0] - '0';for(h = 3, l = 0; h < strlen(search); h++, l++)search[l] = search[h];search[l] = 0;if(id == 1){for(l = 0; l < n; l++){if(strcmp(bk[l].title, search) == 0)num[count++] = bk[l].ID;}}else if(id == 2){for(l = 0; l < n; l++){if(strcmp(bk[l].author, search) == 0)num[count++] = bk[l].ID;}}else if(id == 4){for(l = 0; l < n; l++){if(strcmp(bk[l].publisher, search) == 0)num[count++] = bk[l].ID;}}else if(id == 5){int tmp = 0;for(l = 0; search[l] != 0; l++)tmp = tmp * 10 + search[l] - '0';for(l = 0; l < n; l++){if(tmp == bk[l].year)num[count++] = bk[l].ID;}}else if(id == 3){char str[15] = {0};for(l = 0; l < n; l++){j = 0;while(bk[l].words[j] != 0){for(h = 0; bk[l].words[j] != ' ' && bk[l].words[j] != 0; j++)str[h++] = bk[l].words[j];str[h] = 0;if(strcmp(search, str) == 0){num[count++] = bk[l].ID;break;}if(bk[l].words[j] == 0)break;elsej++;}}}printf("%d: %s\n", id, search);if(count == 0)printf("Not Found\n");else{sort(num, num + count);for(l = 0; l < count; l++)printf("%07d\n", num[l]);}}}return 0;}