Create Shortcut SourceCreate Shortcut Source

Wince5.0下使用VC++2005操作SQLCE3.0数据库，创建、打开数据库及数据表，代码经本人测试通过。-Wince5.0 using VC++2005 operating SQLCE3.0 database, create, open the database and data tables, the code after I test.

万年历的程序，能实现闹钟，时间调整等功能！-Calendar of procedures, to achieve the alarm, the time adjustment function!

VB生物钟提示 VB生物钟提示-VB Tips VB biological clock biological clock biological clock VB Tips Tips

一个给予wince的程序 非常好用 大家可以下载来学习-Wince a given procedure is very easy to use you can download to learn

三层结构开发图书系统.适合初学者学习参考.-Development of circulation systems the three-tier structure. Reference for beginners to learn.

这一个定时提示服务和程序，这只是一个大体程序框架和设计理念，可在此基础上增加功能-A regular prompt services and procedures, it is only a general framework and design process can be on the basis of increasing the number of functional

Basically timer calculator for 8051 for different modes

Line Tracking source using webcam

第一章至第六章主要论述C++/C编程风格。难度不高，但是细节比较多。别小看了，提高质量就是要从这些点点滴滴做起。世上不存在最好的编程风格，一切因需求而定。团队开发讲究风格一致，如果制定了大家认可的编程风格，那么所有组员都要遵守。如果读者觉得本书的编程风格比较合你的工作，那么就采用它，不要只看不做。人在小时候说话发音不准，写字潦草，如果不改正，总有后悔的时候。编程也是同样道理。 第七章至第十一章是专题论述，技术难度比较高，看书时要积极思考。特别是第七章“内存管理”，读了并不表示懂了，懂了并不表示就能正确使用。有一位同事看了第七章后觉得“野指针”写得不错，与我切磋了一把。可是过了两周，他告诉我，他忙了两天追查出一个Bug，想不到又是“野指针”出问题，只好重读第七章。 -Chapter VI which deal mainly with C++/C programming style. The difficulty is not high, but the details are more common. Not sound like, to improve quality is to start from these bit by bit. Does not exist in the world the best programming style, all due to demand. Pay attention to the same style of team development, if approved of established programming style, then all team members must abide by. If readers think this book is also more programming style of your work, then use it, do not look not do. Pronunciation in childhood are not allowed to speak, write illegible, if not corrected, there is always regret the time. Programming is also the same re

已知一颗有根树是 2-tree（只有度为2和度为0的结点），并且有n个叶子节点，从左到右编号为1,2,…, n，还知道两个相邻编号节点之间的 ChonSu（这棵树中这链接这两个节点的路径的边数）。求任意两个叶子节点x, y （1≤x≤n）之间的 ChonSu-Rooted tree is known to a 2-tree (only the degree 2 and degree 0 nodes), and there are n-leaf nodes from left to right numbered 1,2, ..., n, also know that two adjacent numbers between nodes ChonSu (this tree that links these two nodes in the path of the number of edges). Seeking any two leaf nodes x, y (1 ≤ x ≤ n) between the ChonSu