摘要：
Given a tree, you are supposed to list all the leaves in the order of top down, and left to right.Input Specification:Each input file contains one tes... 阅读全文
摘要：
二分法求函数根的原理为：如果连续函数f(x)在区间[a, b]的两个端点取值异号，即f(a)f(b) 2 #include 3 #include 4 using namespace std; 5 6 float f( float x); 7 float a3, a2, a1, a0; 8 9... 阅读全文