这是一个求木材抛光最短时间的程序。就是一根木材有长度和重量，两根木材的这两个属性按照一定顺序排列进行抛光是时间最短，要求解很多根木材以什么顺序进行排列才能使抛光时间最短。-This is a timber for the shortest period of time polishing procedures. There is a length and weight of the timber, the timber 2 in accordance with these two attribu

对字符串进行把个数多于两位的挑选出来，解一元二次方程，利用函数重载在MFC中画图，用三种方法排序，木材抛光问题-On the string to the selected number of more than two, for solving a quadratic equation, using function overloading in the drawing in MFC, sorted in three ways, wood polish problems

木材抛光程序，输出许多木材（数目可以非常大）抛光的顺序。所需时间的规则为，第一次需要一分钟准备时间，以后如果后一次的木材比前一次重且长，不需要准备时间，否则需要一分钟。-It can help decide the order of a mass of woods that is going to be peel.

数据结构实习木材抛光，简单易懂，可直接运行。(Data structure, practice wood polishing, simple and easy to understand, can be run directly.)