New Star的acm

#include #include char ex[15]; char test[15]; int tree[1600],ntree[1600]; void addtree() { int t=strlen(ex); for(int i=0;i<t;i++) { int j=1; while(tree[j]!=-1) { if(ex[i]-'0'>tree[j]) {

#include #include char tmp[50]; int flag; struct tree { char num[50]; tree *l,*r; tree() { l=r=NULL; memset(num,0,sizeof(num)); } }; int min(int a,int b) { return a<b?a:b; } void set(char *s

#include #include char tmp[50]; int flag; struct tree { char num[50]; tree *l,*r; tree() { l=r=NULL; memset(num,0,sizeof(num)); } }; int min(int a,int b) { return a<b?a:b; } void set(char *s