GeneralBus

飞思卡尔单片机SCI编程例子，很有参考价值，。而且有讲解(Freescale' s Microcontroller Programming SCI example of great reference value. But also to explain)

LCD驱动软件，st7565r液晶显示，串行模式(LCD driver software, st7565r liquid crystal display, serial mode)

VB6.0禁止修改系统时间的源代码，Windows系统时间有时是自动更新的，如果不选择自动更新，可以手动去修改它，但目前有一些流行的恶意程序为了自己软件方便会强制修改系统时间，本程序可禁止用户或程序修改系统时间，虽然主窗口打开后什么也没，但此时你双击右下角的Windows系统时间，弹出面板内修改时间的话，你会发现修改过的时间会自动恢复，无法修改。本程序的用意并不是在于让用户就这么运行着要程序，而是让VB编程者可从代码中提取出有用的代码，作为一个模块来用，实现禁止修改Windows系统时间的功能。(VB6.0 prohibit changes to the system s source code, Windows system automatically updates the time and sometimes, if you do not choose to automatically update, you can manually to modify it, but there are some prevalent malicious software programs for their own convenience will force changes to the system, this program can prevent users from modifying the system or program time, although the main window opens after nothing but time to time you double-click on the Windows system the lower right corner to bring up the panel s modification time, you will find the modified time will be automatically restored, can not be modified. This program is not intended that allows users to program running on so, but let VB programmers can be extracted from the code of useful code as a module to use, modify the Windows system time to achieve a ban functio)

一些非常全面的C语言的实例和解析，帮助驯兽学习与练习。(Instance and parse very comprehensive C language, to help the tamer learning and practice.)

获取shadow SSDT 当前地址 用于修改驱动(Get shadow SSDT address is used to modify the current drive)

用socket实现客户端服务器上传下载传输文件(use socket download file)

说明：  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.)

统计学生成绩的程序，对学习界面编程的朋友应该有用，欢迎下载(Student achievement statistics program, should be useful learning interface programming friends are welcome to download)

水库调度POA算法，动态规划的改进方法。(POA algorithm for reservoir scheduling)

Image inpainting example code