-
汉王文本王5300司机的确好用。
汉王文本王5300的驱动程序，确实好用。-Wang 5300 Hanwang text driver is indeed easy to use.
- 2022-05-21 14:20:55下载
- 积分：1
-
program to perform sequential divider in vhdl
program to perform sequential divider in vhdl
- 2023-01-02 23:05:04下载
- 积分：1
-
C++开发的。农夫过河。一个农夫带着一只狼，一只羊和一些菜过河。河边只有一条一船，由 于船太小，只能装下农夫和他的一样东西。在无人看管的情况下，狼要吃羊，羊要吃...
C++开发的。农夫过河。一个农夫带着一只狼，一只羊和一些菜过河。河边只有一条一船，由 于船太小，只能装下农夫和他的一样东西。在无人看管的情况下，狼要吃羊，羊要吃菜，请问农夫如何才能使三样东西平安过河。
-C development. Farmers across the river. A farmer with a wolf, a goat and some vegetables across the river. Only a river boat, the boat is too small to install under the farmer and his thing. Unattended circumstances, the wolf to Qiyang, the sheep to the meal, ask the farmers how to make three things safely across the river.
- 2022-06-01 15:13:42下载
- 积分：1
-
JAVA 扫雷小游戏，JFRAM框架下，16×16 ，默认40个雷，可以设置雷的数量...
JAVA 扫雷小游戏，JFRAM框架下，16×16 ，默认40个雷，可以设置雷的数量-Mine JAVA games, JFRAM framework, 16 × 16, the default 40 mine, you can set the number of mines
- 2022-06-12 16:46:57下载
- 积分：1
-
矩阵的奇异值分解，ap为是矩阵a，up返回左奇异值，vp返回右奇异值...
矩阵的奇异值分解，ap为是矩阵a，up返回左奇异值，vp返回右奇异值-Matrix singular value decomposition, ap is the matrix for a, up to return the left singular value, vp return the right singular value
- 2022-03-03 12:23:18下载
- 积分：1
-
backtracking algorithms circuit board problems
回溯算法中的电路板问题-backtracking algorithms circuit board problems
- 2023-06-10 11:35:04下载
- 积分：1
-
对于ArcObject VBA开发
vba for arcobject 开发-VBA development for arcobject
- 2023-01-23 21:55:04下载
- 积分：1
-
一种关于Z变换新的算法
一种关于FDTD Z变换新算法的程序，程序通过调试，运行正常。A new algorithm of FDTD transform Z
- 2022-02-03 04:27:32下载
- 积分：1
-
Check inside data from the database directly to generate XML documents, can cust...
从数据库里面取数据,直接生成XML文件
,可以自定义查询表而导出数据到XML文件里面-Check inside data from the database directly to generate XML documents, can customize the look-up table and to export data to XML files inside
- 2022-04-27 03:58:43下载
- 积分：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
