一个定时自动关机的源代码

给定的字母表A 由26 个小 写英文字母组成A={a,b,…,z}。该字母表产生的升序字符串是指字符串中字母按照从左到 右出现的次序与字母在字母表中出现的次序相同，且每个字符最多出现1 次。例如， a,b,ab,bc,xyz 等字符串都是升序字符串。现在对字母表A 产生的所有长度不超过6 的升序 字符串按照字典序排列并编码如下。 1 2 … 26 27 28 … a b … z ab ac … 对于任意长度不超过6 的升序字符串，迅速计算出它在上述字典中的编码。 -Given the alphabet A by the 26 lowercase letters of the alphabet composed of A = (a, b, ..., z). Generated by the alphabet ascending string refers to the letter string in accordance with the order from left to right appears in the alphabet and letters appearing in the same order, and each character appears a maximum of 1 times. For example, a, b, ab, bc, xyz, etc. are ascending string string. Alphabet A have now all the length of not more than 6 strings of ascending order in accordance with the dictionary and coding sequence is as follows. 1 2 ... 26 27 28 ... ab ... z ab ac ... for any length of not more than 6 strings of ascending quickly calculate it in the dictionary encoding.

系统工具，最新系统维护工具，绿色版，无需安装。-fdsafdfdafdsaf

解决线性assignment的算法，非常高效-Solve the linear assignment algorithm, very efficient

Windows下的TC，很不错的，欢迎大家使用，-Windows TC, very good and you are welcome to use,

Reconstruction of Solid Models from Oriented Points Sets

C语言版快速傅立叶变换Fast Fouier Transform(fft)-C language version of Fast Fourier Transform Fast Fouier Transform (fft)

设T[0:n-1]是n个元素的一个数组。对任一元素x，设S(x)={i|T[i]=x}。当|S(x)|>n/2时，称x为T的主元素。设计一个线性时间算法，确定T[0:n]是否有一个主元素。-Set T [0: n-1] is the n elements of an array. Of any element x, set S (x) = (i | T [i] = x). When | S (x) |> n/2 when x for T said the main element. Design a linear time algorithm to determine the T [0: n] whether there is a main element.

类似网络蚂蚁的拖放窗口，VC＋＋源代码，希望大家能用得上。-NetAnts similar drag-and-drop window, VC source code, hope that we can useful.

汉字算法识别 汉字算法识别 -Algorithm for Chinese character recognition algorithm for Chinese character recognition algorithm for identification

VC的软件换肤程序-VC software Eurocargo procedures