1022. Digital Library (30)

1022. Digital Library (30)

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define N 80+1
struct book
{
    char id[8];
    char title[N];
    char author[N];
    char keywords[100];
    char publisher[N];
    char pubyear[5];
}book[10001];
int comp(const void*a,const void*b)
{
    struct book *p=(struct book*)a,*q=(struct book*)b;
    return strcmp(p->id,q->id);
}
void TitleSearch(char s[],int n)
{
    int check=0,i=0;
    while(i<n)
    {
        if(strcmp(book[i].title,s)==0)
        {
            check=1;printf("%s\n",book[i].id);
        }
        ++i;
    }
    if(!check)printf("Not Found\n");
}
void AuthorSearch(char s[],int n)
{
    int check=0,i=0;
    while(i<n)
    {
        if(strcmp(book[i].author,s)==0)
        {
            check=1;printf("%s\n",book[i].id);
        }
        ++i;
    }
    if(!check)printf("Not Found\n");
}
void KeySearch(char s[],int n)
{
    int check=0,i=0;
    while(i<n)
    {
        if(strstr(book[i].keywords,s))
        {
            check=1;printf("%s\n",book[i].id);
        }
        ++i;
    }
    if(!check)printf("Not Found\n");
}
void PublisherSearch(char s[],int n)
{
    int check=0,i=0;
    while(i<n)
    {
        if(strcmp(book[i].publisher,s)==0)
        {
            check=1;printf("%s\n",book[i].id);
        }
        ++i;
    }
    if(!check)printf("Not Found\n");
}
void PubYearSearch(char s[],int n)
{
    int check=0,i=0;
    while(i<n)
    {
        if(strcmp(book[i].pubyear,s)==0)
        {
            check=1;printf("%s\n",book[i].id);
        }
        ++i;
    }
    if(!check)printf("Not Found\n");
}
int main()
{
    int m,i=0,n;
    scanf("%d",&n);
    getchar();
    while(i<n)
    {
        gets(book[i].id);
        gets(book[i].title);
        gets(book[i].author);
        gets(book[i].keywords);
        gets(book[i].publisher);
        gets(book[i].pubyear);
        ++i;
    }
    qsort(book,n,sizeof(struct book),comp);
    scanf("%d",&m);
    while(m--)
    {
        int sign;
        char s[100];
        scanf("%d: ",&sign);
        gets(s);
        printf("%d: %s\n",sign,s);
        switch(sign)
        {
            case 1:TitleSearch(s,n);break;
            case 2:AuthorSearch(s,n);break;
            case 3:KeySearch(s,n);break;
            case 4:PublisherSearch(s,n);break;
            case 5:PubYearSearch(s,n);break;
        }
    }
    return 0;
}
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值