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:

3

1111111

The Testing Book

Yue Chen

test code debug sort keywords

ZUCS Print

2011

3333333

Another Testing Book

Yue Chen

test code sort keywords

ZUCS Print2

2012

2222222

The Testing Book

CYLL

keywords debug book

ZUCS Print2

2011

6

1: The Testing Book

2: Yue Chen

3: keywords

4: ZUCS Print

5: 2011

3: blablabla

Sample Output:

1: The Testing Book

1111111

2222222

2: Yue Chen

1111111

3333333

3: keywords

1111111

2222222

3333333

4: ZUCS Print

1111111

5: 2011

1111111

2222222

3: blablabla
题意：根据给定的信息，查找该信息出自哪本书
思路：这题主要是一个输入问题，信息查找只要字符串进行比较即可。
AC代码：

#define _CRT_SECURE_NO_DEPRECATE

#include<iostream>

#include<algorithm>

#include<cmath>

#include<cstring>

#include<string>

#include<set>

#include<queue>

#include<map>

using namespace std;

#define INF 0x3f3f3f

#define N_MAX 10000+5

typedef long long ll;

struct book{

    string id, title,auther,publisher,publish_year;

    vector<string>key;

    bool operator < (const book&b) {

        return id < b.id;

    }

};

int n;

vector<book>vec;

int main() {

    while (scanf("%d",&n)!=EOF) {

          getchar();

        for (int i = ; i < n;i++) {

            book b;

            getline(cin, b.id);

            getline(cin, b.title);

            getline(cin, b.auther);

            do {

                string tmp; cin >> tmp;

                b.key.push_back(tmp);

            } while (getchar()!='\n');

            getline(cin, b.publisher);

            getline(cin, b.publish_year);

            vec.push_back(b);

        }

        sort(vec.begin(),vec.end());

        int m; cin >> m;

        while(m--) {

            vector<book>res;

            int cs; string s;

            scanf("%d: ", &cs);

            getline(cin,s);

            for (int i = ; i < vec.size();i++) {

                if (s == vec[i].auther||s == vec[i].id||s==vec[i].publisher||s==vec[i].publish_year||s==vec[i].title) { res.push_back(vec[i]);continue; }

                else {

                    for (int j = ; j < vec[i].key.size(); j++) {

                        if (s == vec[i].key[j]) {

                            res.push_back(vec[i]); break;

                        }

                    }

                }

            }

            printf("%d: %s\n", cs, s.c_str());

            if (res.size()) {

                for (int i = ; i < res.size(); i++) {

                    cout << res[i].id << endl;

                }

            }

            else puts("Not Found");

        }

    }

    return ;

}