-
本软件采用VB开发,用于上位机和S7
本软件采用VB开发,用于上位机和S7-200系列PLC PPI协议通讯-Using VB to develop this software for PC and S7-200 series PLC PPI protocol communications
- 2022-03-06 21:28:10下载
- 积分:1
-
Matlab图形图像处理函数详细列表 Matlab图形图像处理函数详细列表...
Matlab图形图像处理函数详细列表 Matlab图形图像处理函数详细列表-Matlab graphics image processing functions in detail a list of Matlab graphics image processing function of a detailed list of Matlab graphics image processing function of a detailed list of
- 2023-01-03 05:55:04下载
- 积分:1
-
自已写的跨Frame菜单,一般的菜单都会被Frame遮住
自已写的跨Frame菜单,一般的菜单都会被Frame遮住-Cross-Frame to write their own menus, the menu will be generally covered Frame
- 2022-01-26 08:19:26下载
- 积分:1
-
带音乐功能的跑表VerilogHDL描述
带音乐功能的跑表VerilogHDL描述-music with the stopwatch Verilog HDL description
- 2022-04-30 17:14:12下载
- 积分:1
-
介绍路由器的设置,帮你更加深入理解网络。
介绍路由器的设置,帮你更加深入理解网络。
- 2023-02-23 03:05:04下载
- 积分:1
-
java版本的哈夫曼编码 可以编码也可以解码
java版本的哈夫曼编码 可以编码也可以解码-java version of the Huffman codes can also be encoded decoder
- 2023-04-13 03:20:03下载
- 积分:1
-
新编剑桥商务英语(BEC)(中、高级)词汇
新编剑桥商务英语(BEC)(中、高级)词汇-New Business English (BEC) (senior) vocabulary
- 2023-05-01 22:15:03下载
- 积分:1
-
将USB端口设备虚拟为网卡设备的软件,还可以
将USB端口设备虚拟为网卡设备的软件,还可以-The USB port equipment for the virtual network adapter software, you can
- 2022-01-27 12:19:17下载
- 积分:1
-
本压缩文件是关于windows xp优化大师的七十项REG文件
本压缩文件是关于windows xp优化大师的七十项REG文件-the compressed files on the windows xp optimize the master document 70 REG
- 2023-01-03 23:05:04下载
- 积分: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