资源列表
stdio-common
- 绝对正真的stdio.h的实现，从原始的io角度看待自己所编写的c指令，对以后c的深入研究大有裨益。-absolute stdio.h is really the realization of the original from the perspective of their io prepared by the c direction right after c-depth study of great benefit.
time for c
- c编译器中time.h的实现，对于要想了解c的标准库，有必要看一看。-time.h had the realization that if you want to understand the criteria for c, it is necessary to look at.
三维按钮
- 实现非常漂亮的三维按钮，代码完整，内含注释。-achieve very beautiful 3D buttons, code integrity, containing notes.
6位数码管时钟程序2222
- 数码6位数码管时钟程序2222 6 位数码管多功能时钟程序 74HC164驱动LED 显示 74hc138进行位选 Creat By: 单片东东 2004.12.28 bian xie-six digital clock control procedures 2222 6-bits digital clock control procedures 74HC164 multifunctional LED Display Driver 74hc138 for Creat
FontComboexex
- 很好用的字体下拉框，详情请看www.codeprject.com 有用的字体-good use of font drop-down box, the details please see www.codeprject.com useful font
8个软件
- 8个源码为jsp的文件。是我下载的，具体功能有一定的介绍，现需要本站上的一些程序希望能够采用。以后有钱了一定成为你门的VIP会员。不胜感谢-eight jsp source for the documents. Yes, I downloaded the specific function to a certain extent, is the site needs some procedures to adopt. After the money to a certain door you b
程序22
- 给定N个大小不等的圆C1，C2，…，现将这N个圆排进一个矩形框中，且要求个圆与矩形框的底边相切。圆排列问题要求从N个圆的所有排-given N ranging from the size of the circle C1, C2, ..., N now it is discharged into a round rectangular box, demanding 000 yen rectangular box with the bottom tangent. Yuan with the pro
youzi.cpp
- 给定N个大小不等的圆C1，C2，…，现将这N个圆排进一个矩形框中，且要求个圆与矩形框的底边相切。圆排列问题要求从N个圆的所有排-given N ranging from the size of the circle C1, C2, ..., N now it is discharged into a round rectangular box, demanding 000 yen rectangular box with the bottom tangent. Yuan with the pro
圆排列问题5
- 给定N个大小不等的圆C1，C2，…，现将这N个圆排进一个矩形框中，且要求个圆与矩形框的底边相切。圆排列问题要求从N个圆的所有排-given N ranging from the size of the circle C1, C2, ..., N now it is discharged into a round rectangular box, demanding 000 yen rectangular box with the bottom tangent. Yuan with the pro
图的m着色问题
- 给定无向量图G顶点和m种不同的颜色。用这些颜色为图G的各顶点着色，每个顶点着一种颜色。是否有一种着色法使G图中每条边的两个顶点着不同的颜色。这个问题是图的m可着色判定问题给定无向量图G顶点和m种不同的颜色。用这些颜色为图G的各顶点着色，每个顶点着一种颜色。是否有一种着色法使G图中每条边的两个顶点着不同的颜色。这个问题是图的m可着色判定问题-given no vector graph G vertices and m different colors. Using these color grap
最大团问题2
- 定义一个类，调用构造函数，递归函数，输出函数-definition of a category, called Constructors, recursive function, output function
n后问题
- 在 n 行 n 列的国际象棋棋盘上，最多可布n个皇后。 若两个皇后位于同一行、同一列、同一对角线上，则称为它们为互相攻击。 n皇后问题是指找到这 n 个皇后的互不攻击的布局。 n 行 n 列的棋盘上，主次对角线各有2n-1条。-n n trip out of the international chess board, the maximum n Queen's cloth. If two at the same Queen's visit, the same s