-
AES算法加密工具
AES算法加密工具,使用C++语言实现--------------------------------
- 2022-01-25 18:54:11下载
- 积分:1
-
a description of the problem is : No. 1, 2, ..., n n clockwise direction by indi...
约瑟夫问题的一种描述是:编号为1,2,…,n的n个人按顺时针方向围坐一圈,没人持有一个密码。一开始人选一个正整数作为报数上限值m,从第一个人开始按顺时针自1开始报数,报到m是停止报数。报m的人出列,将他的密码作为新的m值,从他在顺时针方向上的下一个人开始重新从1报数,如此下去,直至所有人全部出列为止。-a description of the problem is : No. 1, 2, ..., n n clockwise direction by individuals sitting around a circle, no one holding a password. One person started as a positive integer limits on the number of reported m, from the first individuals to embark on the clockwise from a few reportedly started, the report m is reportedly stopped a few. M reported out of the list of his password as a new value m, from a clockwise direction in the next re-started from a newspaper a few, like that, until the total of all listed so far.
- 2022-02-03 16:31:48下载
- 积分:1
-
从 c + + 的.txt 文件中读取文本
从 c + + 的.txt 文件中读取文本。此功能可帮助您阅读 txt 文件,如果你是一个初学者,使用很方便
- 2022-04-17 22:59:52下载
- 积分:1
-
Newton down France
Newton下山法-Newton down France
- 2022-05-08 08:21:53下载
- 积分:1
-
蚁群算法作为一种新的智能计算模式, 由于其离散性本质而在组合优化问题上取得 巨大成
功,但这也限制了它在连续问题求解中的应用。...
蚁群算法作为一种新的智能计算模式, 由于其离散性本质而在组合优化问题上取得 巨大成
功,但这也限制了它在连续问题求解中的应用。-Ant colony algorithm as a new kind of intelligent computing model because of its nature discrete combinatorial optimization problems in on a great success, but it also limits the problem to solve for the application.
- 2022-02-04 11:07:14下载
- 积分:1
-
fast fourier transform serving filter design
快速傅立叶变换是计算各种实际问题的常用方法。
- 2022-05-14 13:41:02下载
- 积分:1
-
一个对点列进行线性拟合的例子
一个对点列进行线性拟合的例子-Points out a linear fitting example
- 2022-04-08 01:57:42下载
- 积分:1
-
mps create
mps create
- 2022-12-22 10:50:03下载
- 积分:1
-
The Simulation of BER of QDPSK
这个文件是用来模拟QDPSK的误码率的。结果被写入一个txt文件,然后您可以将其导入matlab。
- 2022-02-12 18:16:28下载
- 积分:1
-
DELPHI FFT written procedures, the demonstration curve, convenient reference.
DELPHI写的FFT程序,有曲线的演示,方便大家参考。-DELPHI FFT written procedures, the demonstration curve, convenient reference.
- 2023-03-16 17:20:03下载
- 积分:1