又一个Ping的例子

旅行商问题 某售货员要到若干城市去推销商品，已知各城市之间的路程（或旅费）。他要选定一条从驻地出发，经过每个城市一遍，最后回到驻地的路线，使总的路程（或旅费）最小。动态归划

acm.zju.com 中1002的第一个输入的答案 城堡中放堡垒的问题-acm.zju.com 1002 were the first to import the answer to a castle fortress of release

滑动条的显示状态-sliding strip"s state

汇编语言应用实例,用具体例子教你学汇编 -assembly language application examples, specific examples teach you to learn Series

DFA的“语言”是这个DFA接受的所有的串的集合。假设a1a2…an是输入符号序列，让这个DFA从初始状态q0开始运行。查询转移函数δ，比如说δ(q0,a1)=q1，以找出DFA在处理了第一个输入符号a1之后进入的状态。处理下一个输入符号a2，求δ(q1,a2)的值，假设这个状态是q2。以这种方式继续下去，找出状态q3,q4,…,qn，使得对每个i，δ(qi-1,ai)=qi。如果qn属于F，则接受输入a1a2…an，否则就“拒绝”。-DFA" s " language" is the DFA to accept all of the string collection. A1a2 ... an assumption is an input symbol sequence, so that the DFA into operation from the initial state q0. Look transfer function δ, say δ (q0, a1) = q1, in order to identify the DFA in dealing with the first input into the state after the symbol a1. To the next input symbol a2, seeking δ (q1, a2) values, assuming that this state is q2. Continue in this way to find out the state q3, q4, ..., qn, making for every i, δ (qi-1, ai) = qi. If qn belongs to F, then accept the input a1a2 ... an, otherwise, " refuse."

对于残缺棋盘的图形演示，可以演示出是如何放入棋盘的-Defective chessboard graphics for presentations, can be a demonstration of how the board Add the

相当不错的C++课件，过程化语句尽快掌握必备-Fairly good C++ Courseware, the process of statement as soon as possible the necessary

本压缩包是最优阵列处理中的程序 ，包含前6章，是非常好的学习代码，以后的程序代码还没出来。-The array package is the optimal treatment procedures, including the first 6 chapters, is a very good study code, not after the program code out.

c++编写的矩阵求逆，数值分析作业 ！！！！1-c++ written in matrix inversion

no i have no describe