奋斗青年的专栏

一道树的题目 #include #include #include #include #include #include #include #include #include #include #include using namespace std; struct node { char data; node*left; node*right; }; node*

Tree Summing Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 7866   Accepted: 1815 Description LISP was one of the earliest high-level programming languages

用一个Dps，把它输出来。 A quadtree is a representation format used to encode images. The fundamental idea behind the quadtree is that any image can be split into four quadrants. Each quadrant may again be spli

重建一棵树   Tree  You are to determine the value of the leaf node in a given binary tree that is the terminal node of a path of least value from the root of the binary tree to any le

用数组装就好，不要用树。 #include #include #include #include #include using namespace std; int fuck(int di,int ci){ int ans=1; for(int i=1;i<=ci;i++)ans*=di; return ans; } int main(){ //ifstre

非常简单，输入字符串到一个一维数组，然后从字符串的