功能齐全的产品展示系统ASP源码

一个c++RPG小游戏 使用windows API做的-a C++ RPG game

计算机组成原理试题11，提供给在校学生，或者考研需要者，希望能提供一些帮助-Principles of Computer Organization Test 11, made available to students at school, or study section for those who need it, hoping to provide some help

DVB硬件设计电路，包括原理图、PCB等，可以直接使用-DVB hardware circuit design, including schematic, PCB and so on, can be directly used

利用opnet网络仿真软件,研究802.11的QOS,可以利用此模块研究802.11e-opnet use of network simulation software, the study 802.11 QOS, You can use this module study 802.11 e

迷宫求解，求得很多条路径。有详细的文挡，从文件读入迷宫形式-maze solving, and seek many of the trails. A detailed text block, read from the paper forms maze

好好的 好好的 好好的 好好的 好好的-Good good good good good good good good good

IEEEuwb信道模型下采用pam调整的超宽带通信仿真程序。-simulation program of ultra widebandth communicaiton using pam modulation,the channel model adopt is IEEE uwb channel model.

彩票软件源代码（delphi源码-其它源码）.rar-lottery software source code (delphi source-other source). Rar

现在好了，您可以通过，易家自助建站平台方便地建立网站；强大的网站管理系统，只要会打字，就可随时管理网站内容！ 　　只要您会打字就可轻松拥有一个属于自己的商务网站，全方位展示你的产品，在线订购，轻松管理。建网站就是这么简单！-good now, and you can easily help themselves to the establishment of the station platform website; Powerful Web site management system, so long as typing, can be ready to manage site content! As long as you can be typed easily own a business website, displayed in all aspects of your products, online ordering, easy management. Construction site is so simple!

编写筛选查找素数函数： 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.