VFP编程与软件开发若干实例 VFP编程与软件开发若干实例

资源描述MFC没有自带的treelist控件，然而对数据的处理有时需要树形结构的列表来处理数据。这就需要我们自己编写一个treelist控件方便用户调用

vc灵感编程范例源代码 41 3DButton 42 计时器 43 动态改变光标和图标 44 捕获鼠标 45 得到一些系统信息 46 确定应用程序的路径 47 注册系统热键 48 检测光驱软驱是否准备就绪 49 判断驱动器的类型 50 检测磁盘容量 51 MyFormat 52 Win98下热键关机 53 获得当前屏幕的分辨率两种方法 54 在screen上显示文字 55 启动屏幕保护程序 56 开机后程序自动运行 57 Windows 2000下关机 58 屏蔽系统热键 59 获取文件图标 60 避免程序运行多个实例-vc inspiration source code programming examples 3DButton 42 41 43 timer to change the cursor and dynamic map superscript 44 mouse caught some 45 information systems 46 to determine the application"s path 47 registration system hotkeys 48 Detection floppy drive the readiness of 49 drivers to judge the types of detection disk capacity 50 51 52 MyFormat Win98 hotkeys under 53 was shutdown current screen resolution two methods in 54 characters displayed on the screen started 55 of 56 screen saver automatically reboot after running under Windows 2000 57 58 Off Screen Hotkey 59 cover access to documents icon 60 to avoid running multiple instances of

系统使用人员主要分为两类，即管理员与教师 教师可以查询自己的开课信息 教师可以查询，修改某个课程所有学生的成绩信息 教师录入成绩完毕需要等待管理员审核 管理员审核通过后，教师不得修改学生信息-System are mainly divided into two categories, namely, teachers administrators and teachers can learn about their own course information, teachers can access, modify a curriculum for all students to score the score finished recording information teachers need to wait approval by an administrator after the vetting administrators, teachers students shall not modify the information

基于MFC和STL平台的字符串类，可以实现在快速字符串搜索-Platform based on the MFC and the STL string class, can be achieved in the fast string search

二部图的一个算法-two of the plan is an algorithm

CEDraw是一个在WinCE中实现高速画图的库-CEDraw is a WinCE in achieving high-speed drawing of the library

TCP/IP Sorce Code

该程序是有关 h u f f m a n 编 码的相关事宜-huffman

asp投票系统，用户可以根据自己的需要进行套票、 实现简单功能-asp voting system, users can meet their own needs for package simple function

一个用变形贪婪法解货郎回路的C程序代码 思想 1．选择一条最短的边作为部分解。 2．选择一条最短的且将之加入到部分解不形成回路的边。 3．重复第2步，直至所有的结点都包含在部分解中。-deformation with a greedy method for the Traveling Salesman circuit C code ideological one. Choose a minimum as part of the solution side. 2. Choose one of the shortest but to incorporate it into solutions that do not form part of the loop side. 3. Repeat Step 2 until all the nodes are included in some solution.