fjnu 1193 Duplicate Words

Description

What background? Seemed like a good idea at the time...

Input

Anyway, you're to write a program that reads in a whole bunch of words (each word is no more than 20 characters) and spit out the duplicate words. For our purposes, words are to be separated by spaces, commas (,), !, ?, and periods (.). No word goes past the end of a line. There can be an arbitrary amount of duplicate words. All comparisons should ignore case.

Output

Output the duplicate words, one per line, in lower case and in sorted order.

Sample Input

How much wood would a woodchuck chuck if a woodchuck could chuck wood? Well? what do you think? Are you feeling well?

Sample Output

a
chuck
well
wood
woodchuck
you

 KEY:这题好恶心，居然一个CASE搞了好多行……搞死了……丢人

 

Source:

#include<iostream>
#include<string>
#include<map>
#include<algorithm>
using namespace std;

char str[200][1000];

struct node
...{
    char str[25];
    int num;
};

node a[1001];
int m;
map<string,int> mp;
int K;

int find(char str[])
...{
    for(int i=1;i<=m;i++)
        if(!strcmp(str,a[i].str)) return i;
}

void GetList()
...{
    
    char* step=" (),.!?";
    char* t;
    int i;
    for(int k=1;k<=K;k++)
    ...{
        for(i=0;i<strlen(str[k]);i++)
            if(str[k][i]>='A'&&str[k][i]<='Z') str[k][i]=str[k][i]+32;
            t=strtok(str[k],step);
            while(t!=NULL)
            ...{
                if(mp[string(t)]==0)
                ...{
                    strcpy(a[++m].str,t);
                    a[m].num++;
                    mp[string(t)]++;
                }
                else
                ...{
                    int pos=find(t);
                    a[pos].num++;
                }
                t=strtok(NULL,step);
            }
    }
}

int compare(node x,node y)
...{
    if(x.num==1&&y.num>1) return 0;
    if(x.num>1&&y.num==1) return 1;
    if(x.num==1&&y.num==1) return 0;
    if(x.num>1&&y.num>1)
    ...{
        if(strcmp(x.str,y.str)>0) return 0;
        else return 1;
    }
}

void output()
...{
    for(int i=1;i<=m;i++)
    ...{
        if(a[i].num>1)
            cout<<a[i].str<<endl;
        else break;
    }
}

void input()
...{
    while(gets(str[++K])) ;
}

int main()
...{
//    freopen("fjnu_1193.in","r",stdin);    
    input();
    GetList();
    sort(a+1,a+m+1,compare);
    output();
    return 0;
}