C++编写的基地保卫战源代码

它是一款非常实用的JAR转JAD文件的工具！-It is a very useful tool for JAR transfer JAD file!

使用LabVIEW编写的一个计算器程序。 计算器能完成的运算： 加减乘除，求平方，求立方，求自然对数，求以10为底的对数，求阶乘求正弦余弦正切值，符号取反 能完成的操作：角度与弧度的切换，退格，清零 缺点：由于显示使用的是数值类型，所以无法实现小数输入；只能进行十进制的计算，不支持其它进制，统计功能未实现-LabVIEW prepared to use a calculator program. Calculator to complete the calculations: addition and subtraction multiplication and division, and square, and cubic, and the natural logarithm, and to 10 for the end of the logarithm, and factorial values for sine cosine tangent, symbols take to complete the operation of the anti: the angle with radian switch, backspace, Clear shortcomings: As the show using a numerical type, it is not possible to realize a small number of input only for the calculation of the metric system, do not support the other band, did not achieve statistical functions

IT++ is a C++ library of mathematical, signal processing and communication system routines/functions. Its main use is in simulation of communication systems or for performing research in the area of communications.

C++ by Dissection presents a thorough introduction to the programming process by carefully developing working programs to illuminate key features of the C++ programming language. Program code is explained in an easy-to-follow, careful manner throughout. The code has been tested on several platforms and is found on the bundled CDrom accompanying this text. The code in C++ By Dissection can be used with most C++ systems, including those found in operating systems such as MacOS, MS-DOS, OS/2, UNIX, and Windows.

windows midi 播放器,相当不错,很不错-MIDI Player

asp个人网站实例，包括创建过程等，在tomcat下或是小型的asp工具下就可以运行-asp examples of personal websites, including the creation process, etc., under tomcat or small, can be run under asp tool

开始菜单美化程序与源代码-Start menu beautification procedures and source code

Stack, Queue, List, BST and etc C++ source code

编写筛选查找素数函数： void sieve(bool isPrime[], int n) 其中isPrime[ ]为一个布尔型数组，n为数组大小。由于2是第一个素数， 所以设置isPrime[0]和isPrime[1]的值为false，并设置其余的元素初值为true。 然后对从4到n－1的每一个i，判断i是否能够被2整除，如果i能够被2整除，则设置isPrime[i]为false。 对从2到n/2的每一个可能的数值重复以上处理，当操作结束时，所有值为true的isPrime[i]所对应的i就是素数，它们将是从筛子中掉下来的。-Find prime numbers prepared by screening the function: void sieve (bool isPrime [], int n) which isPrime [] as a Boolean array, n is the size of the array. Because 2 is the first prime number, so set the isPrime [0], and isPrime [1] a value of false, and set the initial value of the remaining elements of true. And then from 4 to n-1 for each i, to determine whether i can be divisible by 2, if i can be divisible by 2, then set the isPrime [i] is false. From 2 to n/2 possible values for each one to repeat the above processing, when the operation ended, all the true value of the isPrime [i] corresponding to i is a prime number, they will be falling from the sieve in the past.

混合991_编译实验-mixed 991_ compiler experiment