New Star的acm

#include #include struct tree { int count; tree *next[30]; char c[20]; int mark; tree() { count=0; mark=0; for(int i=0;i<26;i++) { next[i]=NULL; } } }*root; void build(char *ch,cha

#include #include struct tree { int count; tree *next[30]; tree() { count=0; for(int i=0;i<26;i++) { next[i]=NULL; } } }*root; void build(char *word) { tree *item=root; for(int i=0;w

#include char num[50]; int ans; struct tree { int cnt; tree *next[15]; tree() { cnt=0; for(int i=0;i<15;i++) { next[i]=NULL; } } }*root; int max(int a,int b) { return a>b?a:b; } void

#include #include char map[1005][1005]; char s[1005]; int m,n,t; int sx,sy; int div[8][2]={{-1,0},{-1,1},{0,1},{1,1},{1,0},{1,-1},{0,-1},{-1,-1}};// struct ANS { int x,y; char towards; }ans[1005]; s

#include #include char str[50001][50]; char map[1005][1005]; char s[1005]; int m,n,t; int sx,sy; int div[8][2]={{-1,0},{-1,1},{0,1},{1,1},{1,0},{1,-1},{0,-1},{-1,-1}}; struct ANS { int x,y; char tow

#include #include char word[105],num[105],ans[105],it[105]; int times,flag; int phone[8][4]={{0,1,2},{3,4,5},{6,7,8},{9,10,11},{12,13,14},{15,16,17,18},{19,20,21},{22,23,24,25}}; int ch[8]={3,3,3,3,3,

#include #include struct tree { int count; tree *next[30]; char c[20]; tree() { count=0; for(int i=0;i<26;i++) { next[i]=NULL; } } }*root; void build(char *ch,char *word) { tree *ite

#include #include char word[1001][21]; struct tree { tree *next[30]; int time; int fin; tree() { for(int i=0;i<30;i++) { next[i]=NULL; } time=0; fin=0; } }*root; void set(char *s) {

字典树+并查集一道比较不错的题，欧拉图，值得一做