资源列表
LinkList
- 链表的各种操作：创建，删除，添加等。C++编写，VC上运行无错可行-Linked list of the various operations: create, delete, add, etc. C++ write the VC running on the wrong feasible
em_music
- EMLOG music 插件防刷新。怎么刷都会继续播放、-EMLOG music plug-in anti-refresh. How the brush will continue to play
Eight-Queens-code
- 介绍了用回溯的方法解决八皇后问题。通过改变参数，还能扩展解决N皇后问题-Back method to solve the eight queens problem. By changing the parameters, but also extended to solve the N queens problem
FFT-
- 傅里叶变换 离散傅里叶变换、快速傅里叶变换 C语言实现-Fourier transform fft DTFT DTF
qinglilajisfz66
- sfz66.com提供的清理系统垃圾的小源码，很简单实用-sfz66.com provide clean common system junk source is very simple and practical
MAZE
- 隨機產生迷宮, 可手動行走迷宮或使用自動計算迷宮路徑-Automatic calculation of the maze path
qzygsxqf
- 全主元高斯消去法解n阶线性方程组,c++语言，供初学者学习。-Full main Gaussian elimination method for solving linear equations of order n c++ language for beginners to learn.
lbcrwt
- 链表的插入，不破坏原有的链接关系，插入点该在他应该在的位置，即应该有一个插入位置的查找过程。-The insertion of the list, does not destroy the original link between the insertion point where he should, that is, there should be an insert location of the search process.
qjfg
- 用i来表示x轴上坐标为[i-1,i]的区间（长度为1），并给出M（1≤M≤200）个不同的整数，表示M个这样的区间。现在让你画几条线段覆盖住所有的区间，条件是：每条线段可以任意长，但是要求所画线段的长度之和最小，并且线段的数目不超过N（1≤N≤50）。-I to the coordinates of the x-axis is the interval [i-1, i] of (1), and gives M (1 鈮� M 鈮� 200) integer, said
plzh
- 由8个不同自然数形成奇特的立方体，任意给出n(n不小于8)个不同自然数，任选8个数，将这8个数分别放在一个立方体的八个顶点上，要求每个面上的四个数之和相等，找出所有方案。-Strange cube formed by eight different natural numbers, any given n (n is not less than 8) the number of different natural, optional 8 the number of these eight the
download
- JAVA扫雷，个人觉得代码知识比较简单，算法比较简洁，稍后还会上传其它游戏小程序源码。-JAVA mine clearance
n-m
- n进制数转m进制数，供c++语言初学者学习参考。-n hexadecimal turn m hexadecimal number for the c++ language beginners to learn reference.