{"ref":null,"ref_type":"repository","master_branch":"master","description":"struct trie {      struct nodeDesign{         int cnt;         int next[52];     } node[100001];     int non; /// number of nodes...      void insert(char *s) {         int len=strlen(s);         int now=0;         for(int i=0; i<len; i++) {             int id = (s[i]>='a'&&s[i]<='z') ? ((s[i]-'a')+26) : (s[i]-'A') ;             if(node[now].next[id]==-1)                 node[now].next[id]=++non;             now=node[now].next[id];         }         node[now].cnt++;     }     void clear() {         non=0;         for(int i=0; i<100001; i++) {             for(int j=0; j<52; j++) {                 node[i].cnt=0;                 node[i].next[j]=-1;             }         }     } } tree;","pusher_type":"user"}