pat1022 Digital Library

这道题麻烦是麻烦点,思路倒是还算简单。

比较坑的就是最后要用07d%打印。

还学到了一个挺重要的东西,就是如何读取一行输入中的连续字符串。

while(cin>>str)

{

  char c;

  c=getchar();

  if(c=='\n')

    break;
}

  

#include<bits/stdc++.h>
using namespace std;
const int maxn = 10005;
map<string, set<int>>title;
map<string, set<int>>author;
map<string, set<int>>keyword;
map<string, set<int>>publisher;
map<string, set<int>>year;
int n;
bool cmp(int a, int b)
{
	return a > b;
}
typedef struct book
{
	int digit;
	string title;
	string author;
	string keyword;
	string publisher;
	string year;
}book;
book books[maxn];
int main()
{
	scanf("%d", &n);
	int i;
	for (i = 0; i < n; i++)
	{
		scanf("%d", &books[i].digit);
		getchar();
		getline(cin, books[i].title);
		getline(cin, books[i].author);
		string key;
		while (cin >> key)
		{
			keyword[key].insert(books[i].digit);
			char c = getchar();
			if (c == '\n')
				break;
		}
		getline(cin, books[i].publisher);
		getline(cin, books[i].year);
		title[books[i].title].insert(books[i].digit);
		author[books[i].author].insert(books[i].digit);
		publisher[books[i].publisher].insert(books[i].digit);
		year[books[i].year].insert(books[i].digit);
	}
	int n;
	scanf("%d", &n);
	for (i = 0; i < n; i++)
	{
		int query;
		scanf("%d: ", &query);
		string str;
		getline(cin, str);
		if (query == 1)
		{
			printf("%d: ", query);
			cout << str << endl;
			if (title[str].size() == 0)
			{
				printf("Not Found\n");
			}
			else
			{
				set<int>::iterator it = title[str].begin();
				for (; it != title[str].end(); it++)
				{
					printf("%07d\n", *it);
				}
			}
		}
		else if (query == 2)
		{
			printf("%d: ", query);
			cout << str << endl;
			set<int>::iterator it = author[str].begin();
			if (author[str].size() == 0)
			{
				printf("Not Found\n");
			}
			else
			{
				for (; it != author[str].end(); it++)
				{
					printf("%07d\n", *it);
				}
			}
		}
		else if (query == 3)
		{
			printf("%d: ", query);
			cout << str << endl;
			if (keyword[str].size() == 0)
			{
				printf("Not Found\n");
			}
			else
			{
				set<int>::iterator it = keyword[str].begin();
				for (; it != keyword[str].end(); it++)
				{
					printf("%07d\n", *it);
				}
			}
			
		}
		else if (query == 4)
		{
			printf("%d: ", query);
			cout << str << endl;
			set<int>::iterator it = publisher[str].begin();
			if (publisher[str].size() == 0)
			{
				printf("Not Found\n");
			}
			else
			{
				for (; it != publisher[str].end(); it++)
				{
					printf("%07d\n", *it);
				}
			}
		}
		else if (query == 5)
		{
			printf("%d: ", query);
			cout << str << endl;
			set<int>::iterator it = year[str].begin();
			if (year[str].size() == 0)
			{
				printf("Not Found\n");
			}
			else
			{
				for (; it != year[str].end(); it++)
				{
					printf("%07d\n", *it);
				}
			}
		}
	}
}

  

转载于:https://www.cnblogs.com/legendcong/p/9636288.html

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值