sendingsms

界面编程的对话框初级编辑教程，适合新手学习(Programming interface dialog primary tutorial, suitable for novice learning)

使应用程序支持网页浏览，VC++精选学习源码，很好的参考资料。(The application supports webpage browsing, select learning VC++ source code, a good reference.)

基于MFC在编辑框中实现文件的打开、查找和关键字搜索定位等功能(Based on MFC it realized the openning and searching of files or texts in your edit box and so on )

能够实现鹰眼图的功能，这是一个用VB+AE编写的工程，已经经过调试，没有问题。(To realize the function of the eagle eye chart )

该代码实现的功能是对.tif格式的图片自动分页，并且可以实现数据的查找切割提取。(To achieve the functions of the code. Tif format images automatically paging, and extract data to find cutting.)

说明：  一个类型安全的通用指针 智能指针的any_ptr可以指向任何类型的对象，提供类型安全的访问。(A Type-safe Generic Pointer )

RISC-V指令集模拟器，可用于运行RISC-V源码。(RISC-V instruction set simulator.)

一个拼音输入法源码 (The source for an PINYIN input method)

设X[ 0 : n - 1]和Y[ 0 : n – 1 ]为两个数组，每个数组中含有n个已排好序的数。找出X和Y的2n个数的中位数。  编程任务 利用分治策略试设计一个O (log n)时间的算法求出这2n个数的中位数。 数据输入 由文件input.txt提供输入数据。文件的第1行中有1个正整数n（n<=200），表示每个数组有n个数。接下来的两行分别是X，Y数组的元素。结果输出 程序运行结束时，将计算出的中位数输出到文件output.txt中(Let X [0: n- 1] and Y [0: n- 1] for the two arrays, each array containing the n number has been sorted. 2n X and Y to identify the number of digits.  programming tasks using the divide and conquer strategy try to design an O (log n) time algorithm to calculate this median number 2n. Data input by the input data provided input.txt file. The first line in the file has a positive integer n (n < = 200), that there are n numbers of each array. The next two lines are the X, Y array elements. The end result is output program runs, the calculated median output to file output.txt)

使用Base64编码实现的相应的邮件的发送的程序，// Original class CFastSmtp written by // christopher w. backen <immortal@cox.net> // More details at: http://www.codeproject.com/KB/IP/zsmtp.aspx(Achieved using the Base64 encoding to send the message corresponding procedures,// Original class CFastSmtp written by// christopher w. backen <immortal@cox.net>// More details at: http://www.codeproject.com/KB/IP/zsmtp.aspx)