-
NTL is a high
NTL is a high-performance, portable C++ library providing data structures and algorithms for manipulating signed, arbitrary length integers, and for vectors, matrices, and polynomials over the integers and over finite fields.
- 2023-01-01 04:45:03下载
- 积分：1
-
这个代码写在巴斯科姆编译器控制和制动装置
this code write under bascom compiler for control and trig a device
- 2022-08-08 04:22:46下载
- 积分：1
-
实现ＶＣ和ＡＮＳＹＳ的调用，可以方便地实现两个软件之间的连接，同时可以实现图形用户界面的操作．...
实现ＶＣ和ＡＮＳＹＳ的调用，可以方便地实现两个软件之间的连接，同时可以实现图形用户界面的操作．-ＲＥＡＬＩＺＥ ＴＨＥ ＣＯＮＮＥＣＴＩＯＮ ＯＦ ＴＨＥ ＡＮＳＹＳ ＡＮＤ ＶＣ．ＳＯ ＩＴ ＩＳ ＶＥＲＹ ＣＯＮＶＩＮＩＥＮＴ ＦＯＲ ＵＳ ＴＯ ＵＳＥ ＴＨＥ ＳＯＦＴ ＡＮＤ ＭＡＫＥ ＧＯＯＤ ＵＳＥ ＯＦ ＴＨＥ ＲＥＳＯＵＲＣＥ．．．．．．．．．．．．．．．．．．．．．．．．．．．．．．．．．．．．．．．．
- 2022-01-23 10:46:12下载
- 积分：1
-
这是一个彩票程序，算法科学，用法简单。
这是一个彩票程序，算法科学，用法简单。-This is a lottery process, the algorithm science, and applying simple.
- 2022-02-02 08:39:04下载
- 积分：1
-
PHP programming language, the mail routines PHP and MYSQL
PHP编程语言发邮件的例程 PHP+MYSQL-PHP programming language, the mail routines PHP and MYSQL
- 2022-05-17 00:58:04下载
- 积分：1
-
System will automatically delete the directory of
System will automatically delete the directory of
- 2022-01-28 16:58:00下载
- 积分：1
-
LCD design resource reference for the inquiry PANEL resources
LCD设计资源参考，用于查询PANEL资源-LCD design resource reference for the inquiry PANEL resources
- 2023-04-07 07:30: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
-
24点游戏源代码
24点游戏源代码-24 point game source code
- 2023-08-04 06:45:03下载
- 积分：1
-
人类
版五子棋人机对弈模式 -Human-computer version of backgammon game mode
- 2022-03-26 02:19:01下载
- 积分：1
