]]>
]]>
#include<iostream>using namespace std;struct dictree
{
struct dictree *child[26]; int num;
};int main(){ int i; char word[11]; struct dictree root;// = new dictree; for(i=0;i<26;i++) root.child[i] = NULL; root.num = 0; while(cin.getline(word,11),word[0])//杈撳叆鏂規(guī)硶寰坣iu
{ struct dictree *now = &root; char *tmp = word; while(*tmp) { if(now->child[*tmp-'a']==NULL) { now->child[*tmp-'a']=new dictree; now=now->child[*tmp-'a']; for(i=0;i<26;i++) now->child[i] = NULL; now->num = 1;
} else { now=now->child[*tmp-'a']; now->num ++; } tmp++; } } while(cin.getline(word,11),cin && word[0]) { int mins=100000; struct dictree *now = &root; char *tmp = word; while(*tmp) { now=now->child[*tmp-'a']; if(!now) { mins = 0; break; } if(now->num < mins) mins = now->num; tmp++; } cout<<mins<<endl; } return 0;}]]>
/**//*510010010011024*/#include<iostream>using namespace std;int i;struct dictree { struct dictree *child[10]; int num; dictree() { for(i=0;i<10;i++) child[i]=NULL; num = 0; } ~dictree() { for(i=0;i<10;i++) if(child[i]) delete child[i]; }};int main(){ int n; while(cin>>n) { int maxs = 0; char digit[31]; struct dictree root; while(n--) { cin>>digit; char *tmp = digit; while(*tmp == '0')//鍘繪帀鍓嶇紑0 tmp++; struct dictree *now = &root; while(*tmp>='0' && *tmp<='9')//娉ㄦ剰涓嶈兘鍐欐垚*tmp { if(now->child[*tmp-'0'] == NULL) now->child[*tmp-'0'] = new dictree; now = now->child[*tmp-'0']; //now->num++;//涓嶈兘鍐嶅姞 tmp++; } now->num++; if( maxs < now->num) maxs = now->num; } cout<<maxs<<endl; } return 0;}]]>