yestin_L的博客

#include <iostream>#include <cstdio>#include <string>#include <vector>using namespace std;const int maxn = 26;vector<int> pile[maxn];int n;void find_block(int a...

##题目###分析题目：两个数字相加，然后需要以一定格式输出。先求相加，然后把数字一个个对10取模输出，相对比较容易。用栈做一个后进后出就好了。###代码：#include <iostream>#include <algorithm>#include <stack>using namespace std;stack<char> st...

###题目1020 Tree Traversals （25 分）Suppose that all the keys in a binary tree are distinct positive integers. Given the postorder and inorder traversal sequences, you are supposed to output the level o...

题目A supply chain is a network of retailers（零售商）, distributors（经销商）, and suppliers（供应商）– everyone involved in moving a product from supplier to customer.Starting from one root supplier, everyone on t...

代码#include <iostream>#include <cstdio>#include <vector>#include <string>#include <algorithm>#include <sstream>#include <queue>using namespace std;s...

类型二叉搜索树, 先序后序转换题目A Binary Search Tree (BST) is recursively defined as a binary tree which has the following properties:The left subtree of a node contains only nodes with keys less than the node’s...

试题：CCF201312试题1.出现次数最多的数分析：因为需要记录数字以及其出现次数，用C++STL中的map，可以简单完成代码：#include &lt;iostream&gt;#include &lt;cstdio&gt;#include &lt;string&gt;#include &lt;vector&gt;#include &lt;deque&gt;#incl...

#include &lt;iostream&gt;#include &lt;string&gt;#include &lt;algorithm&gt;/* run this program using the console pauser or add your own getch, system("pause") or input loop */using namespace std...

#include &lt;iostream&gt;#include &lt;algorithm&gt;#include &lt;cstring&gt;#include &lt;cstdio&gt;using namespace std;/* run this program using the console pauser or add your own getch, system("...

#include &lt;iostream&gt;#include &lt;cstdio&gt;#include &lt;cstring&gt;/* run this program using the console pauser or add your own getch, system("pause") or input loop */const int maxn = 100 +...

#include &lt;iostream&gt;#include &lt;stack&gt;#include &lt;string&gt;using namespace std;/* run this program using the console pauser or add your own getch, system("pause") or input loop */st...

#include &lt;stdio.h&gt;#include &lt;string.h&gt;int num[10];void count(int a){ char str[6]; sprintf(str, "%d", a); int i = 0; for(i = 0; i&lt;strlen(str); i++) {// printf("%d:%c\n", i, ...

#include &lt;stdio.h&gt;#include &lt;string.h&gt;#include &lt;math.h&gt;#define W_C 12.01#define W_H 1.008#define W_O 16.00#define W_N 14.01int ToNum(char *s, int n){ int sum = 0; if(n==0...

#include&lt;stdio.h&gt;int main(){int a, b;scanf("%d%d", &amp;a, &amp;b);printf("%d %d\n", b, a);return 0;}采用黑盒测试

一、注意1.每行输出均应以回车符结束,包括最后一行。除非特别说明,每行的行首不应有空格,但行末通常可以有多余空格。另外,输出的每两个数或者字符串之间应以单个空格隔开。二、技巧1.尽量用const关键字声明常数。2.常数pi, const pi = acos(-1.0)...

#include &lt;iostream&gt;#include &lt;string&gt;#include &lt;vector&gt;#include &lt;algorithm&gt;#include &lt;map&gt;using namespace std;map&lt;string, int&gt; cnt;string repr(const string&a...

#include &lt;cstdio&gt;int main (void){ long long a,b; int c; while (scanf ("%lld%lld%d",&amp;a,&amp;b,&amp;c) == 3 &amp;&amp; !(a == 0 &amp;&amp; b == 0 &amp;&amp; c == 0)) { ..

类型：树的遍历，dfs题目：A family hierarchy is usually presented by a pedigree tree. Your job is to count those family members who have no child.InputEach input file contains one test case. Each case starts ...