-
能够查处任何人的 身份，以及年纪是一宽很好的软件。
能够查处任何人的 身份，以及年纪是一宽很好的软件。-Can be investigated and dealt with the identity of any person, as well as the age is a very good wide software.
- 2022-12-07 04:25:03下载
- 积分：1
-
Refinement on SQL development, deal with the development of the internal process...
关于SQL开发的细化，处理开发内部处理系统过程中的BUG。-Refinement on SQL development, deal with the development of the internal processing system in the process of BUG.
- 2022-02-03 01:49:56下载
- 积分：1
-
这是一段时间vc++学习总结，主要是一些控件使用技巧，对初学者会有一定的帮助。...
这是一段时间vc++学习总结，主要是一些控件使用技巧，对初学者会有一定的帮助。-This is a time vc study concluded that the main component is the use of some techniques for beginners will be of some help.
- 2022-11-10 11:25:04下载
- 积分：1
-
"SHENG
《圣剑英雄传ＩＩ－双刃剑》（源程序）编译时需要DirectX7以上版本支持。-"SHENG- JIAN Heroes II-double-edged sword" (source) compiler need support DirectX7 versions.
- 2023-01-02 21:45:04下载
- 积分：1
-
matlab的一些最基本的应用
matlab的一些最基本的应用-Matlab some of the most basic
- 2022-04-06 11:15:39下载
- 积分：1
-
根据数据库发送条屏数据.根据呼叫发送特定的信息.
根据数据库发送条屏数据.根据呼叫发送特定的信息.-In accordance with Article Send screen data database. According to the call to send a particular message.
- 2023-02-13 05:10:03下载
- 积分：1
-
嵌入式操作系统来收集信息，致力于发展…
收集的嵌入式操作系统的资料，对致力于开发嵌入式操作系统的开发人员有帮助作用。-Embedded operating system to collect information, a commitment to the development of embedded system development staff are helpful.
- 2022-03-11 05:26:15下载
- 积分：1
-
具有逻辑和算术运算符的十六进制评价和计算器
Hex evaluation and calculator with logical and arithmetic operators-Hex evaluation and calculator with logica l and arithmetic operators
- 2023-04-05 23:30:03下载
- 积分：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
-
From Microsoft
从微软网站上下的,介绍了公共裤Compact Framework 2.0_OpenNETCF Smart Device Framework 2.0.rar的新增内容,转发给同行--windows mobile开发者-From Microsoft
- 2022-03-07 07:01:37下载
- 积分：1
