Using CDC to complicate line drawing!

描 述：该程序实现了在Excel中读取学生的E-mail地址、成绩、姓名等，结合Jmail实现成绩单的群发，并加 入了一些出错处理 -Description: This program implements in Excel, read E-mail address of student achievement, name, etc., combined with the mass Jmail achieve transcripts, and added some error handling

这是一个很好的程序很好用,希望给各会员们提供方便.-This is a good procedure is useful, the members hope to provide convenience.

一个非常小巧的闹钟，目的是为了实现托盘的各种技巧实现！-a very small alarm clocks, in order to achieve a tray of different techniques to achieve!

很多卡管理用于添加、 删除、 修改、 导出。然后查询为 1 个月、 2 月、 3 个月和过期。

利用MFC实现的能够能够在对话框里面编辑HTM的程序-Can be achieved using MFC in a dialog box can be edited inside the HTM program

CSDN程序员网站的好东西，关于C/C++的资料-It is a good thing from csdn programmer network station ,about c/c++ .

得到文件驱动器、路径、扩展名等信息-The example of getting dirver , path and extension of file

一个万年历显示程序，同时能调用系统的时间，显示在输出屏幕上！-a calendar display program, can call the system the time displayed on the output screen!

爱立信R380s模拟器.-Ericsson R380s simulator.

以深度为k的满二叉树(n=2k-1)为例，假设表中每个记录的查找概率相等，即 pi=1/n（1≤i≤n），而树的第i层上有2i-1个结点，因此，折半查找的平均查找长度为： 所以，折半查找的平均时间复杂度为O(log2n)。 -To a depth of k over the binary tree (n = 2k-1) as an example, suppose the table to find the probability of each record the same, that is, pi = 1/n (1 ≤ i ≤ n), and the tree layer of the first i There are 2i-1 nodes, therefore, to find half the average length of search as follows: Therefore, to find half the average time complexity is O (log2n).