swineherd的博客

/*Sample Input9A 50 10B 10 20C 20 5D 30 35E 35 15F 15 5G 5 10H 10 20I 20 25ABC(AA)(AB)(AC)(A(BC))((AB)C)(((((DE)F)G)H)I)(D(E(F(G(HI)))))((D(EF))((GH)I))Sample Output000error...

/*The input contains multiple test cases, each describing a single tree. A tree is specified by giving thevalue in the root node, followed by the description of the left subtree, and then the descrip...

递归求解 非常巧妙/*The input begins with a single positive integer on a line by itself indicating the numberof the cases following, each of them as described below. This line is followed by a blankline, and...

这个题的第二组数据一直过不了，原因是int layer=t.layer写在了for的外面，导致每一个方向共用了一个layer。/*InputThe input consists of several data sets. The first line of the input file contains the number of data setswhich is a positive in...

/*Sample Inpute2 e4a1 b2b2 c3a1 h8a1 h7h8 a1b1 c3f6 f6Sample OutputTo get from e2 to e4 takes 2 knight moves.To get from a1 to b2 takes 4 knight moves.To get from b2 to c3 takes 2 knight m...

#include<bits/stdc++.h>using namespace std;typedef struct node * tree;typedef struct node{ tree rchild; tree lchild; char data;}node;tree dfs(char *in,char *pre,int length){ ...

给下落的深度和小球个数，小球依次下落，结点有个开关，每到一个结点，开关关向左，开向右一开始想到了简单模拟，结果超时…[cpp] view plain copy#include <cstdio>  #include <iostream>  #include <cstring>  #define maxn 20   using namespace std;    i...

学到了cin.get()清除输入流的换行符和getline(cin,s)获取一行的输入。#include<bits/stdc++.h>using namespace std;int main(){ int t; cin>>t; cin.get(); while(t--) { string s; ...

这一题是典型的欧拉道路题目。  欧拉道路的定义是： 除了起点和终点外， 其他点的“进出” 次数应该相等。 换句话说，除了起点和终点外， 其他点的度数应该是偶数。对于有向图， 则必须其中一个点的出度恰好比入度大1， 另一个的入度比出度大。如果奇点数不存在的话， 则可以从任意点出发，最终一定会回到该点（成为欧拉回路）。 题目给的单词量比较大，但是有用的只有首和尾的字母，所以只需要存首尾...

拓扑排序水题，但因为没做好邻接阵的初始化导致WA了几发，以后一定要注意初始化！！！#include<bits/stdc++.h>using namespace std;#define maxn 1000vector<int> G[maxn];int in[maxn]; //入度int topo[maxn], t,n,m;void init(...

数组模拟链表#include<cstdio>#include<iostream>#include<cstring>using namespace std;const int maxn =1000000+5;int last,cur,nex[maxn];char s[maxn];int main(){ while(cin>>s+...

dfs+查过的做记号/*ample Input1 1*3 5*@*@***@***@*@*1 8@@****@*5 5****@*@@*@*@**@@@@*@@@**@0 0Sample Output0122 */#include <iostream>#include<cstring>using namespace s...