POJ 2001 Shortest Prefixes

题目要求要给所有字符串找一个最短的前缀，让能够根据这个最短的前缀与其他的字符串区别开，这里用一个字典树，每个节点记录相应字母出现的次数，在建立完字典树之后查询的时候遇到1或者字符串遍历到结尾的时候进行输出，比较容易的题目。

#include <iostream>
#include <cstdio>
#include <memory.h>
using namespace std;

#define maxp 30
#define maxn 25
#define maxl 1050

struct node{
    int Count;
    node* p[maxp];
};

char str[maxl][maxn];
int loc = 0;

void insert(node *root,int loc,int k,int len){
    root->Count++;

    if(k==len)
        return;

    int Temp = (int)(str[loc][k]-'a');
    node *tp = (root->p)[Temp];
    if(!(root->p)[Temp]){
        tp = (root->p)[Temp] = new node;
        tp->Count = 0;
        memset(tp->p,0,sizeof(tp->p));
    }
    //printf("count: %d\n",root->Count);
    insert(tp,loc,k+1,len);
}

void check(node *root,int loc,int k,int len){
    if(root->Count == 1 || k==len){
        printf("%s ",str[loc]);
        for(int i=0;i<k;++i){
            printf("%c",str[loc][i]);
        }
        printf("\n");
        return;
    }
    int Temp = (int)(str[loc][k]-'a');
    check((root->p)[Temp],loc,k+1,len);
}

int main(){
    node *root = new node;
    root->Count = 0;
    memset(root->p,0,sizeof(root->p));
    while(scanf("%s",&str[loc])!=EOF){
        /*char h=cin.get();
        h = cin.peek();
        if(h=='\n')
            break;*/

        int len = strlen(str[loc]);
        //printf("%s\n",str[loc]);
        insert(root,loc,0,len);
        loc++;
    }

    for(int i=0;i<loc;++i){
        int len = strlen(str[i]);
        check(root,i,0,len);
    }
    //system("pause");
    return 0;
}