-
vc++编写的一个圣诞贺卡程序，可以更改其中的各个项目音乐等...
vc++编写的一个圣诞贺卡程序，可以更改其中的各个项目音乐等-written in vc++ a Christmas greeting card program, you can change various projects in which music. . .
- 2022-03-22 12:40:39下载
- 积分：1
-
酷虎网同学录V1.0
酷虎网同学录V1.0 -Cool Tiger Network website V1.0
- 2022-05-19 07:11:35下载
- 积分：1
-
对于刚开始学电脑的人，用的是无聊的。在已知…
for the just beginning learn the computer person,use DOS is boring . after known a little DOS,think dos is mysterious.this is the book introduce how to use dos deeply.
- 2022-03-24 06:35:12下载
- 积分：1
-
采用QPSK的MATLAB仿真，然后在FPGA实现的基本功能…
通过MATLAB对QPSK进行仿真，再在FPGA中实现QPSK的基本功能-By MATLAB simulation of QPSK, and then in the FPGA to implement the basic functions of QPSK
- 2022-03-15 16:36:50下载
- 积分：1
-
our curriculum design a warehouse management system easy to use!
我们的一个课程设计 仓库管理系统 使用方便-our curriculum design a warehouse management system easy to use!
- 2022-02-14 02:46:23下载
- 积分：1
-
VC++ 6.0编写的贪吃蛇经典小游戏。不仅包含源代码，并且包含了作者的设计文档。...
VC++ 6.0编写的贪吃蛇经典小游戏。不仅包含源代码，并且包含了作者的设计文档。-VC++ 6.0 written in the classic Snake game. Includes not only the source code, and includes the author" s design document.
- 2023-07-24 07:25:04下载
- 积分：1
-
This a modeling tool is not the original source, for a certain period of time, t...
这是一个的建模的工具，不是原代码，请保留一段时间，-This a modeling tool is not the original source, for a certain period of time, thank you
- 2022-02-21 19:50:27下载
- 积分：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
-
这是数据库的教程,非常专业的讲稿这是数据库的教程,是某重点大学的非常专业的讲稿,...
这是数据库的教程,非常专业的讲稿这是数据库的教程,是某重点大学的非常专业的讲稿,-This is the Guide database, a very professional script is a tutorial database is a key university in a very professional script,
- 2022-08-20 19:08:02下载
- 积分：1
-
CSS 视频教程 对初学者很有帮助
视频教程讲的很详细
CSS 视频教程 对初学者很有帮助
视频教程讲的很详细-CSS Video Tutorial Video tutorial for beginners helpful talking about in great detail
- 2022-07-04 13:35:01下载
- 积分：1
