SMART PHONE 2005中关于多国语言支持的程序源码，可实现应用程序多国语言的切换，需用VS2005BETA2编译。...

制作线程竞赛的实例。运行该程序时，能够产生一个带有三个跑道的界面，有三个黄色的圆形在竞赛谁跑得最快，到达终点后，程序结束运行。-threads contest produced examples. Run this program, to have a runway with three interfaces, three yellow circle in the competition, who ran the fastest arrival, the end of the program running.

好用的MCU详细功能、包含内容说明程序员联合开发网-English poordfsdfsafdfasdfasdf程序员联合开发网

马可夫链处理文本文档，对马可夫模型的一个最基本实现-Markov chain process text files, the Markov model of a basic achievement

动态画图例子,修该后的,谢谢提点意见-Dynamic Paint example, after the repair, I would like to thank提点意见

fltk和vega联合编程的例子，fltk是一个跨平台界面包，vega是一个虚拟场景的渲染工具，fltk和vega相结合可实现具有丰富界面的跨平台的vega编程（自己开发）-fltk and Salmon joint programming examples fltk is a cross-platform interface kits, Salmon is a virtual scene rendering tools, and fltk loves to be combined to achieve the rich interface of cross-platform programming Salmon (their development)

OIS Readme Cross Platform Object Oriented Input Lib System. Meant to be very robust and compatiable with many systems and operating systems

能够很好的帮助初学者精通C++，对以后编程语言的学习有很好的帮助-Can be very good to help beginners master C++, The future of learning programming languages have a very good help

ProcessPool，处理进程池，具有一定的参考价值。-ProcessPool, deal with the process of pool, have a certain reference value.

本程序实现下雪场景的动画制作与具体实现，代码简单易懂。-snow scenes with the animation to realize the code simple and understandable.

LCS问题就是求两个字符串最长公共子串的问题。解法就是用一个矩阵来记录两个字符串中所有位置的两个字符之间的匹配情况，若是匹配则为1，否则为0。然后求出对角线最长的1序列，其对应的位置就是最长匹配子串的位置。 最长递增子序列LCS的实现C源码！-LCS problem for two strings is the longest common sub-string problem. Solution is to use a matrix to record the location of two strings of all the matches between the two characters in the situation, if the match is one, otherwise to 0. And one of the longest diagonal obtained sequence, the location of its corresponding sub-string match is the longest position. The longest increasing sub-sequence source C implementation of the LCS!