PAT A1022 digital library (30)

 

卧槽卧槽！这道题有一个坑点！输出一定要补全七位（%7d）不然最后两个测试通不过，因为输入0000000之类的，int型会忽略前面的0

#include<cstdio>
#include<map>
#include<string>
#include<set>
#include<cstring>
#include<algorithm>
using namespace std;
map<string,set<int> > mp;
void restorekey(char key[],int id){
    int i=0,j=0;
    int len=strlen(key);
    while(j<len){
        string word;
        while(key[j]!=' ' && j<len){
            word+=key[j++];
        }
        if(j<=len){
            mp[word].insert(id);
            i=j+1;
            j=i;
        }
    }
}
int main(){
    int n,i,m;
    scanf("%d",&n);
    int id;
    char title[85],author[85],keywords[55],publish[85],time[5];
    for(i=0;i<n;i++){
        scanf("%d",&id);
        getchar();
        gets(title);
        gets(author);
        mp[title].insert(id);
        mp[author].insert(id);
        gets(keywords);
        restorekey(keywords,id);
        gets(publish);
        scanf("%s",time);
        mp[publish].insert(id);
        mp[time].insert(id);


    }
    scanf("%d",&m);
    int code;
    char queryword[85];
    for(i=0;i<m;i++){
        scanf("%d: ",&code);
        gets(queryword);
        printf("%d: %s\n",code,queryword);
        if(mp.count(queryword)==0) printf("Not Found\n");
        else{
            set<int>::iterator it=mp[queryword].begin();
            for(it;it!=mp[queryword].end();it++){
                printf("%07d\n",*it);
            }
        }
    }
    system("pause");
    return 0;
}