OS

说明：  结合MFC和opengl编程，可以显示网格，网格的格式为obj # 顶点数 面片数 v....f....(Combination of MFC and opengl programming, you can display the mesh, the mesh format obj# Vertices few patches v. ... f. ...)

一个简单的电子词典，能实现中英互译，不带数据库(a simple dictionary without data library)

一个启用和禁用设备的例子，该代码展示了禁用和启用USB设备的功能。如果需要禁用软驱和光驱，需要修改相应的参数。(Enable and disable a device example, the code to display the disable and enable USB devices. If you need to disable the floppy drive and optical disk drive, a need to amend the corresponding parameters.)

Beginning Visual C++ 2010 First Edition

用CSHARP实现超市的管理，包括进货，销货，比较适合初学学入门者，从大体上去掌握CSHARP用于WINForm的应用 (The CSHARP to achieve the management of the supermarket, including purchases, sales, and more suitable for beginners Introduction to general grasp CSHARP for WINForm application)

windows下很好的，计算时间的小工具。准确，使用方便。(windows under good, the computation time small tools. Accurate, and easy to use.)

说明：  利用VB6.0计算指定日期在一年当中的排序，以1月1日为第一天。(Sort calculated using VB6.0 specified date in the year to January 1 as the first day.)

MFC架构下，通过ADO方式连接Access数据库的实例，事先了完整的添加、修改、删除功能，VS2010编写。特点是实现了数据库中日期数据类型的读写，比较有借鉴意义。(MFC framework, connected through the Access database, ADO instance, in advance of the complete add, modify, delete function, VS2010 preparation. Feature is realized in the database to read and write the date data type, compared with reference.)

说明：  Euler 回路问题 .问题描述： 对于给定的图G 和G 中的2 个顶点v 和w，连接顶点v 和w 且经过图中每条边恰好1 次 的路径称为顶点v 和w 之间的1 条Euler 路。当v=w 时得到一条首尾相接的Euler 回路。 .编程任务： 对于给定的图G，编程计算图G 的一条Euler 回路。 .数据输入： 由文件input.txt 给出输入数据。第1 行有2 个正整数n 和m，表示给定的图G 有n 个 顶点和m 条边，顶点编号为1，2，…，n。接下来的m 行中，每行有2 个正整数u,v ，表示 图G 的一条边(u,v) 。 .结果输出: 将编程计算出的Euler 回路输出到文件output.txt 。如果不存在Euler 回路，则输出-1。(Euler circuit problem. Problem description : for a given graph G and G of two vertices v, w, connectivity and vertex v w map through which each side precisely the path to a meeting called vertices v, w between a Euler Road. When v = w be an end-to-end circuit Euler. . Programming tasks : for a given graph G, programming terms of a graph G Euler circuit. . Data input : from the document input.txt given input data. Line 1 has two positive integers n and m, to the graph G with n vertices and m edges and vertices numbered 1, 2, ..., n. Next m OK, every trip has two positive integer u, v, said of a graph G edge (u, v). . Results output : Programming will be calculated by Euler circuit output to a file output.txt. If there is no Euler circuit, the output 1.)

将.fasta文件中的contig进行处理的小程序，包括NodeCopyer、contig两个应用。搞基因工程的同学们可以用一下。(It s for dealing with .fasta files, which contains NodeCopyer and contig .)