1022

#include<iostream>
#include<queue>
#include<vector>
#include<string>
#include<cstring>
#include<string.h>
#include<iterator>
#include<algorithm>

using namespace std;

class Book
{
public:
	string Id;
	string Title, Author, Key_words, Publisher, Published_year;
	bool is_KeyWord(string q)
	{
		q = q + ' ';
		Key_words += ' ';
		auto i = Key_words.begin();
		while (i != Key_words.end())
		{
			auto j = q.begin();
			while (j != q.end())
			{
				if (*i == *j)
				{
					i++;
					j++;
					if (*i == ' ')
						return true;
				}
				else
				{
					j = q.end();
					while (*i != ' ')
						i++;
					i++;
				}
			}

		}
		return false;
	}
};

bool compare(Book a, Book b)
{
	return a.Id < b.Id;
}
void Find(int t, string q);
vector<Book> LBook;
int main()
{
	
	int n;
	cin >> n;
	for (int i = 0; i < n; i++)
	{
		Book book;
		cin >> book.Id;
		cin.ignore();
		getline(cin, book.Title);
		getline(cin,book.Author);
		getline(cin, book.Key_words);
		getline(cin, book.Publisher);
		getline(cin, book.Published_year);
		
		LBook.push_back(book);
	}
	sort(LBook.begin(), LBook.end(), compare);
	
	int m;
	cin >> m;
	for (int i = 0; i < m; i++)
	{
		int t;
		string q;
		cin >> t;cin.ignore(1,':');cin.ignore(1,' ');getline(cin, q);
		Find(t, q);
		
	}
	system("pause");
	return 0;
}
void Find(int t, string q)
{
	cout << t << ": " << q << endl;
	bool flag = false;
	switch (t)
	{
	case 1:
		for (auto iter = LBook.begin();iter != LBook.end(); iter++ )
		{
			if (iter->Title == q)
			{
				flag = true;
				cout << iter->Id << endl;
			}
				
		}
		break;
	case 2:
		for (auto iter = LBook.begin(); iter != LBook.end(); iter++)
		{
			if (iter->Author == q)
			{
				flag = true;
				cout << iter->Id << endl;
			}
				
		}
		break;
	case 3:
		for (auto iter = LBook.begin(); iter != LBook.end(); iter++)
		{
			if (iter->is_KeyWord(q))
			{
				flag = true;
				cout << iter->Id << endl;
			}
				
		}
		break;
	case 4:
		for (auto iter = LBook.begin(); iter != LBook.end(); iter++)
		{
			if (iter->Publisher == q)
			{
				flag = true;
				cout << iter->Id << endl;
			}
				
		}
		break;
	case 5:
		for (auto iter = LBook.begin(); iter != LBook.end(); iter++)
		{
			if (iter->Published_year == q)
			{
				flag = true;
				cout << iter->Id << endl;
			}
				
		}
		break;
	}
	if (!flag)
		cout << "Not Found" << endl;
	return;
}

 

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值