u010652938的专栏

#include #include #include #include using namespace std;void build(int n, char *s1, char *s2, char *s){ if(n <= 0) return; int p = strchr(s2, s1[0]) - s2; build(p, s1+1, s2, s);

#include #include #include #include #include #include using namespace std;char s[10010];typedef struct Tnode{ int have_value; int v; Tnode *left, *right;} Node;Node *root;int

#include #include #include #define maxn 20000+10using namespace std;struct node { int data; int ld, rd; node *l, *r;};bool ok;void dfs(node *t){ if(!ok) return; if(t == NU

#include #include #include #include using namespace std;int a[210][210];int sum[210];void creat(int dep, int mid){ int x; scanf("%d", &x); if(x == -1) return; else { a[

#include #include #include #include #define maxn 20000+10using namespace std;struct node{ int data, flag; node *ll, *l, *r, *rr;};int tmpi;node* &build(int cur, char *s){ node *

#include #include #include #include #include using namespace std;void dfs(char s[210][210], int x, int y, int dep){ for(int i = y; s[x][i] == '-'; ++i) if(s[x+1][i] != ' ' && s[x+1

#include #include #include #include #include #include using namespace std;int main(){ char s1[11000]; while(gets(s1) != NULL) { printf("Expression: %s\n", s1); int