-
Strassen expansion algorithm can even order any calculation of matrix multiplica...
strassen算法的扩展,可以计算任何偶数阶矩阵的相乘,一般strassen只能计算2的n次方阶(自己编写,英文注释~)-Strassen expansion algorithm can even order any calculation of matrix multiplication, general Strassen only two terms of the n-th-order (to prepare themselves, English Notes ~)
- 2022-01-26 01:13:17下载
- 积分:1
-
设计一个项目,排出AOE网络,并将数据输入计算机,用程序进行分析。...
设计一个项目,排出AOE网络,并将数据输入计算机,用程序进行分析。-Design a project, from AOE network, and data entered into the computer, using the procedure for analysis.
- 2022-05-07 23:26:23下载
- 积分:1
-
将前缀表达式转为中缀表达式,并画出所建的树
将前缀表达式转为中缀表达式,并画出所建的树-To prefix infix expression to expression, and draw the tree built
- 2022-03-03 06:47:40下载
- 积分:1
-
程序存储问题:设有n 个程序{1,2,…, n }要存放在长度为L的磁带上。程序i存放在磁带上的长度是Li ,1≤i≤n 程序存储问题要求确定这n 个程序在磁带...
程序存储问题:设有n 个程序{1,2,…, n }要存放在长度为L的磁带上。程序i存放在磁带上的长度是Li ,1≤i≤n 程序存储问题要求确定这n 个程序在磁带上的一个存储方案,使得能够在磁带上存储尽可能多的程序。 编程任务: 对于给定的n个程序存放在磁带上的长度,编程计算磁带上最多可以存储的程序数。 数据输入:由文件input.txt给出输入数据。第一行是正整数n,表示文件个数。接下来的1 行中,有n 个正整数,表示程序存放在磁带上的长度。 结果输出: input.txt output.txt 6 50 5 2 3 13 8 80 20 -program storage problem : There n procedures (1,2, ..., n) to be stored in the length of the L tape. I kept in the proceedings on the tape length is Li, 1 i n storage procedures to seek to establish that n procedures on tape storage of a program that allows the tape to store as much as possible the procedure. Programming tasks : to the n procedures stored in the tape length, calculated programming on tape can store up to the number of procedures. Data input : from the document input.txt given input data. The first line is a positive integer n, said the document number. Following a visit, n is an integer, said procedures stored on tape length. Results output : input.txt output.txt 6 50 5 2 3 13 8 80 20
- 2023-01-10 04:30:04下载
- 积分:1
-
手术室
手术室管理系统是一个ASP.NET应用程序管理预订业务剧院为 请点击左侧文件开始预览 !预览只提供20%的代码片段,完整代码需下载后查看 加载中 侵权举报
- 2022-02-15 15:35:50下载
- 积分:1
-
VCD租赁系统,一个用VB编写的挺好用
VCD租赁系统,一个用VB编写的挺好用-VCD rental system, the one prepared by the VB very good use
- 2022-02-26 03:23:22下载
- 积分:1
-
one for the good dao database development overseas.
一个作的很好的dao数据库开发,值得一看。-one for the good dao database development overseas.
- 2022-08-25 02:30:44下载
- 积分:1
-
在数据结构中编程实现表达式求值算法(加减乘除)
在数据结构中编程实现表达式求值算法(加减乘除)-Structure in the data evaluated the expression programming algorithm (calculation)
- 2022-07-13 14:31:46下载
- 积分:1
-
纯C写的48位软件模拟浮点运算,可移植
测试版,V0.0000.01
需进一步测试及优化...
纯C写的48位软件模拟浮点运算,可移植
测试版,V0.0000.01
需进一步测试及优化-Written in pure C software simulation of 48 floating-point operations can be transplanted beta, V0.0000.01 need further testing and optimization
- 2022-10-29 22:00:04下载
- 积分:1
-
题目:设计一个题目,演示用算符优先法对算术表达式求值的过程。
概要设计
1、顺序扫描中缀算术表达式,当读到数字时直接将其送至输出队列中;
2、当读到...
题目:设计一个题目,演示用算符优先法对算术表达式求值的过程。
概要设计
1、顺序扫描中缀算术表达式,当读到数字时直接将其送至输出队列中;
2、当读到运算符时,将栈中所有优先级高于或等于该运算符弹出,送至输出队列中,再将当前运算符入栈;
3、当读入左括号时,即入栈;
4、当读到右括号时,将靠近栈顶的第一个左括号上面的运算符全部一次弹出,送至输出队列中,再删除栈中的左括号。
5、使用VS栈来存储读入的操作和运算结果,然后进行数字字符到数值的转换。
-Title: Design of a topic, presentation operator priority method with arithmetic expression evaluation process. Summary of design 1, the order of scanning arithmetic infix expressions, when they read numbers directly to the output queue 2, when they read operator, it will stack all priority higher than or equal to the operator pop-up , sent to the output queue, and then the current operator入栈 3, when read left brackets, that is, when入栈 4, when they read the right brackets, it will be near the Top-left of the first operator in brackets above All a pop-up, sent to the output queue, and then delete stacks of left brackets. 5, the use of VS stack to store read operation and computing the results of numeric characters and then proceed to the numerical co
- 2022-03-18 20:45:34下载
- 积分:1