perf_event_server

说明：  自编的文件分割器，功能比较全，可供参考。(Own partition of the documents, and full-feature comparison is available for reference.)

说明：  visio图标库(visio)

在linux下安装ldap的说明文档，只在linux下测试过(Linux install ldap in the documentation, only tested under linux)

提供了许多vc上的界面的类库,使得大家用vc做界面时不太辛苦()

基于Linux操作系统上的C编程与内核导读，有关c语言的linux内核开发(Based on the Linux operating system kernel of C programming and navigation, the c language to develop the linux kernel)

Fraqtive is a program for drawing Mandelbrot and Julia fractals. It uses a very fast algorithm and generates high quality, smooth images.

IOCP的编程例子 IOCP的编程例子-IOCP programming examples IOCP programming examples

好东西进入文件夹routersim2，运行SRSINSTA.EXE安装Routersim2.0。再把crack文件夹下的文件复制到安装目录下覆盖原文件，并运行shkccna2.exe。至此破解完成，2.0版已经可以使用，若要升级到2.1版，请将upto2.1目录内文件复制到安装目录下覆盖原文件，并再次运行shkccna2.exe。这样2.1版就可使用了。...能够管理图书馆的书目(good things into folders routersim2 running SRSINSTA.EXE Routersim2.0 installation. Then crack folder of documents copied to the installation directory coverage under the original document, and run the shkccna2.exe. Thus crack completed version 2.0 can use, in order to upgrade to version 2.1, I would be grateful if upto2.1 directory to copy the installation directory coverage under the original document, and once again running shkccna2.exe. This version 2.1 can be used. ... To manage the library programs.)

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

简单的聊天程序，编译实现，希望大家能够喜欢哈！-A simple chat program, compiler implementation, hope that we can enjoy Ha!