-
电子芯片规则检查语言，用于cadence
电子芯片规则检查语言，用于cadence-Electronic chip rule checking language, for the cadence
- 2022-03-23 16:23:47下载
- 积分：1
-
代码很完整,编译通过,对想学习编写小游戏的朋友很有帮助.代码里有很多注释,很容易读...
代码很完整,编译通过,对想学习编写小游戏的朋友很有帮助.代码里有很多注释,很容易读-Code is complete, the compiler is passed, the preparation of the game want to learn helpful friends. Code, there are a lot of notes, it is easy to read
- 2022-07-10 03:17:07下载
- 积分：1
-
基于单片机的测温程序，带有按键控制和液晶显示，报警等功能。...
基于单片机的测温程序，带有按键控制和液晶显示，报警等功能。-Procedures based on single-chip temperature measurement with keypad control and LCD display, alarm and other functions.
- 2022-03-26 15:24:12下载
- 积分：1
-
arcView下计算长度的工具，采用阿venue写成。
arcView下计算长度的工具，采用阿venue写成。-ArcView calculated the length of the tool, the use of Albanian language venue.
- 2022-01-26 08:32:51下载
- 积分：1
-
a production with vc HANOR games, graphics and concise operation. Worth a play.
一个用vc制作的汉诺塔游戏,图形简洁易操作.值得一玩.-a production with vc HANOR games, graphics and concise operation. Worth a play.
- 2022-06-19 10:57:07下载
- 积分：1
-
在TCL DSDV协议源代码的NS2
source code of dsdv protocol in tcl for NS2
- 2023-02-12 03:35:03下载
- 积分：1
-
在线算法的 C语言
就是在线算法解决背包问题的一种,问题很长...
在线算法的 C语言
就是在线算法解决背包问题的一种,问题很长-Online algorithm is the C language online algorithm to solve a knapsack problem, the question is very long
- 2022-07-11 09:18:05下载
- 积分：1
-
一个万能的摄像头驱动程序,很不错,大家可以下载用
一个万能的摄像头驱动程序,很不错,大家可以下载用-an omnipotent camera driver, very good, we can use downloaded
- 2022-08-08 19:15:11下载
- 积分：1
-
Find prime numbers prepared by screening the function: void sieve (bool isPrime...
编写筛选查找素数函数：
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.
- 2023-03-02 04:45:03下载
- 积分：1
-
一个诺基亚手机的塞班平台上的开发的贪吃蛇的小游戏 可供初学者学习之用...
一个诺基亚手机的塞班平台上的开发的贪吃蛇的小游戏 可供初学者学习之用-Saipan a Nokia mobile phone platform developed by the Snake game for beginners learning
- 2022-05-04 21:49:35下载
- 积分：1
