高等教育出版社 电路 第四版 低9 10 11 章

万年历c实现,简单使用-hefty almanac c realized, simple to use

mmnbvtrhgfhfgh

第六章实验二（1）本程序为魔方阵.C 可用来求出所指定大小的魔方-sixth chapter two experiments (1) the procedure for the Demon phalanx. C can be used to specified sizes calculated by the Cube

这个是用asp来实现个人注册表单，如果 有什么不对的地方还请各位专家指点！谢谢！-this is asp to achieve personal registration form, if what is wrong places also asked the experts to guide! Thank you!

This the H323 open source.

改文档为PHP文档，可供大家参考使用 -reform document for PHP files, which can be used as reference documents for the reform PHP documentation for reference use

DOS下的dma读写驱动，加速硬盘的读写操作。-Dma under DOS to read and write drive, hard disk read and write speed up the operation.

UNIX平台下使用C语言实现的检查主机hostID的函数，可用于程序的加密。-UNIX platform using C language mainframe hostID inspection functions can be used to process the encryption.

C语言课程设计--泊车管理 这是我们C语言课程设计的一个作业。-C language curriculum design parking management This is our C language curriculum design an operation.

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