搜索资源列表
MoShiPiPei
- 有一串10000位数的主串由1、2、3、4四位数随机获得,n位模式串是指有4的n次方个模式串,如2位模式串有:11、12、13、14、21、22、23、24、31、32、33、34、41、42、43、44等16个数组成。现在进行模式匹配,假设主串为:431324113122341324132等等,则第一次比较是43,第二次比较是31,第三次比较是13,依此类推,每比较一次则落得模式串中的一个,当所有模式串(有4的n次方个)都被找到时,记得所比较的次数,则这个次数就是这次匹配的结果。程序执行了
ieee33
- 应用牛顿法的直角坐标系下的33节点潮流计算-33 node flow calculation
33
- 主要提供一本比较经典的数据挖掘的数据,由张贤达主编的数据挖掘课本,以此提供一些初学者资料-Mainly provides a more classic data mining of data, edited by ZHANG Xian-da data mining textbooks for beginners in order to provide some information on
33
- FORTRAN常用算法程序集_10205499,很有用的啊!-FORTRAN common algorithms assembly _10205499, very useful
Eular-Engineering
- Euler工程,相邻元素乘积最大。 给了一个20x20的两位数矩阵,其中的红字部分的积为: 26x63x78x14=1788696 那么,任意方向上(上、下、左、右、对角)4个相邻的数的最大乘积是多少?-In the 20x20 grid below, four numbers along a diagonal line have been marked in red. 08 02 22 97 38 15 00 40 00 75 04 05 07 78 52 12 50 7
BruteForce1700651282004
- Finds every possible combination of ASCII characters, which are between 33 - 126. The characters between 33-126 are all of the possible chars allowed on our keyboard including special chars.- Finds every possible combination of ASCII characters, w
CalNumbers
- 输入33个0-20之间的数,重复数字不超过6个,然后任选6个数字相加等于40,计算出这样的组合有多少个。-Enter the 33 numbers between 0-20, repeat no more than six figures, then optionally 6 digits add up to 40, calculate the number of such combinations.
33nodes
- 33节点基于前推回代法的含分布式电源配电网的潮流计算程序,其中含支路阻抗的原始数据。-33 nodes with distributed power distribution network procedures, the former push back method, with branch impedance of the original data.
New1Composite_14BusMicrogrid
- matlab ieee 33 node bus system microgrid used to stable grid