Miracle_QSH的博客

#include <stdio.h>#include <stdlib.h>struct node{ char data; int l, r;}a[15], b[15];int check(int i, int j){ if(a[a[i].l].data == b[b[j].l].data && a[a[i].r].dat...

#include <stdio.h>#include <string.h>#include <stdlib.h>char a[105], b[105];int n;struct node{ char data; struct node *l, *r;};int max(int a, int b){return a > b ...

#include <stdio.h>#include <string.h>#include <stdlib.h>char a[105];int p, len;struct node{ char data; struct node *l, *r;};struct node *qu[10005];int front = 0, ta...

#include <stdio.h>#include <string.h>#include <stdlib.h>char a[105];int p, len;struct node{ char data; struct node *l, *r;};struct node *qu[10005];int front = 0, ta...

#include <stdio.h>#include <string.h>#include <stdlib.h>int a[10005], p;char data[10005];int vis[10005];void sort(int l, int r){ int i, j; for(i = r - 1; i >= l; i...

简单写法：#include <stdio.h>#include <stdlib.h>#include <string.h>char a[1005];int main(){ int num, i, len; while(gets(a)) { len = strlen(a); num = 0;...

#include <stdio.h>#include <string.h>#include <stdlib.h>char a[105];int p, len;struct node{ char data; struct node *l, *r;};struct node *qu[10005];int front = 0, ta...