08 2021 档案
摘要:#include<bits/stdc++.h>using namespace std;struct node{ char lc,rc,fa;};node tree[1000];void work(char s){ cout<<s; if(tree[s].lc!='*')work(tree[s].lc
阅读全文
摘要:#include<bits/stdc++.h>using namespace std;struct Node{ int data; Node *next;};Node *head,*p,*r;int x;int main(){ cin>>x; head=new Node; r=head; while
阅读全文
摘要:#include<bits/stdc++.h>using namespace std;int k[201];int h[10001];//队列 int p[10001];//记录按第几次 int c[201];//标记是否走过 int n,a,b;int bfs(){ int head=0,tail
阅读全文