Search - multiply

Search - multiply - List

[Data structs] 稀疏矩阵运算器 DL : 0: 题目:稀疏矩阵是指那些多数元素为0的矩阵.利用稀疏特点进行存储和计算可以大大节省存储空间,提高计算效率.实现一个能进行稀疏矩阵基本运算的运算器.基本要求:以带行逻辑连接信息的3元组顺序表表示稀疏矩阵,实现两个矩阵相加,相减和相乘的运算.矩阵的输入形式采用3元组表示,而运算结果的矩阵则以通常的阵列形式列出.概要设计:1.以带行逻辑连接信息的3元组顺序表表示稀疏矩阵2.本程序包含2个模块:(1) 各集合定义模块(2) 主程序模块-topics : sparse matrix refers to those elements for most of the matrix 0. Using sparse features storage and computation can be greatly reduced storage space and improve computational efficiency. One can achieve for sparse matrix operations basic computing device. Basic requirements : OK logical connection with the three yuan Information Group the order said the sparse matrix table to achieve two matrices together, subtract and multiply arithmetic. Matrix entry forms using three yuan Group said, and the results of the matrix operations while the usual array listed. summary of design : 1. in line with the logic of information linking the three element group said sparse chronology matrix 2. this program contains two modules : (1) Set module (2) main program module
Date : 2025-12-28 Size : 46kb User : 雨后阳光
[Data structs] 动态规划-矩阵连乘 DL : 0: 由于矩阵连乘不同结合方式的运算工作量很不一样. 工作量相差也非常大；所以要寻找一种最佳的结合方式, 然后再执行矩阵乘法运算-continually multiply matrices combining different ways of computing workload very different. The workload is also very big difference; So to find the best combination of a way, and then the implementation of matrix multiplication
Date : 2025-12-28 Size : 1kb User : 小康
[Data structs] MatrixMul DL : 0: 矩阵连乘算法，实现几个矩阵相乘的最优顺序，并计算出复杂度-matrix continually multiply algorithm, achieving several matrix multiplication, the optimal sequence and calculated complexity
Date : 2025-12-28 Size : 1kb User : rice
[Data structs] Matrix111 DL : 0: 矩阵连乘问题对多个矩阵连乘时的消耗进行分析-matrix continually multiply problems for a number of matrix continually multiply the consumption analysis
Date : 2025-12-28 Size : 1kb User : 邵柏波
[Data structs] athwartofmatrix DL : 0: 这是一个关于距阵相乘的算法，希望对大家有用！-This is one of the matrix multiply algorithm, we want to help!
Date : 2025-12-28 Size : 1kb User : fangrui
[Data structs] dsjc DL : 0: 大数相乘的源代码,使用C++在VC环境中实现.-multiply large numbers of the source code, the use of C in the VC environment to achieve.
Date : 2025-12-28 Size : 7kb User : 刘志铭
[Data structs] bigNumberMult DL : 0: 大数相乘算法,使用C++语言在VC下实现.-large numbers multiply algorithm, the use of C language in the VC achieve.
Date : 2025-12-28 Size : 3kb User : 刘志铭
[Data structs] myheard DL : 0: 我们的一个数据结构的课程设计,计算一元稀疏距阵的计算器,即是一元多项式的相加\相减\相乘\求导\求X值\...还有利用彩色文本形式编写的一个界面.非常的好看,使用也方便-the data structure of a curriculum design, calculation of one yuan sparse matrix of calculators, serves yuan polynomials together \ subtract \ multiply \ derivative \ for the value of X \ ... There color text prepared by the an interface. very pretty, ease of use
Date : 2025-12-28 Size : 73kb User : 刘建聪
[Data structs] linkedmatrix DL : 0: 一种基于二维链表的稀疏矩阵模半板类设计 A template Class of sparse matrix. Key technology: bin,2-m linked matrix. constructors: 1.normal constuctor 2.copy constuctor. 3.assignment constructor. Basic operator: 1. addition(sub) of two matrix 2. inverse of a matrix. 3. multiply of two matrix. etc.-based on two-dimensional chain of sparse matrix model semi-plate design of Class A's template parse matrix. Key technology : bin. 2-m linked matrix. constructors : 1.normal constuctor 2.copy constuctor. 3.ass ignment constructor. Basic operator : 1. addition (sub) 2 matrix of two. inverse of a ma trix. 3. multiply of two matrix. etc
Date : 2025-12-28 Size : 7kb User : 狄中泉
[Data structs] multiply(LJ) DL : 0: 用链表求300的阶乘,并且返回链表节点的个数.-used for the factorial 300, and returned to the linked list node number.
Date : 2025-12-28 Size : 142kb User : 李小跳
[Data structs] poly DL : 0: 本程序是在turbo c 下运行,实现多项式的相加,相减,相乘.由4个函数组成-This procedure is in turbo c run, realize the sum of polynomials, subtract, multiply. 4 function by the composition of
Date : 2025-12-28 Size : 1kb User : chenweihuan
[Data structs] JuZhenLianCheng DL : 0: 问题描述给定n个矩阵A1，A2，…，An，其中，Ai与Aj+1是可乘的，i=1，2，…，n-1。你的任务是要确定矩阵连乘的运算次序，使计算这n个矩阵的连乘积A1A2…An时总的元素乘法次数达到最少。例如：3个矩阵A1，A2，A3，阶分别为10×100、100×5、5×50，计算连乘积A1A2A3时按（A1A2）A3所需的元素乘法次数达到最少，为7500次。 -Description of the problem given n matrices A1, A2, ..., An, which, Ai and Aj+ 1 is the multiplicative, i = 1,2, ..., n-1. Your mission is to identify the matrix even by computing the order, so that calculation of this n-matrix product A1A2 ... An even when the total number of elements to achieve a minimum of multiplication. For example: three matrices A1, A2, A3, bands were 10 × 100,100 × 5,5 × 50, the calculation even when the product A1A2A3 by (A1A2) A3 multiply the number of elements required to achieve at least for the 7500 meeting.
Date : 2025-12-28 Size : 6kb User : 陈文浩
[Data structs] goodjsq DL : 0: 设计一个简单的计算器类（类型），要求：（1）从键盘读入算式。（2）可以进行加、减、乘、除运算。（3）运算要有优先级。（4）用户可以按任何的运算符出现顺序进行输入。（5）不限定用户输入的计算式的长度。（6）有排错功能，当用户输入错误的算式时提示用户。例如，如果用户输入：3 + 4 * 5 - 7，计算结果应为16。（提示：可以使用本节所定义的栈类来帮助进行处理）。-Design a simple calculator-type (type), requirements: (1) Reading from the keyboard into the formula. (2) can add, subtract, multiply, with the exception of computing. (3) The operator must have priority. (4) the user can press any of the emergence of the order of operator input. (5) does not limit the user to enter the length of the calculation formula. (6) have debugging function, when the user enters the wrong formula when prompts the user. For example, if a user enters: 3+ 4* 5- 7, the calculation results should be 16. (Hint: You can use this section of the stack type definition to help to deal with).
Date : 2025-12-28 Size : 2kb User : wangmeng
[Data structs] Matrix DL : 0: 1. 创建一个十字矩阵 2. 进行十字矩阵的相加 3. 进行十字矩阵的相乘 4. 进行十字矩阵的转置操作 -1. To create a cross matrix 2. For the sum of cross matrix 3. To carry out cross matrix multiply 4. To carry out cross matrix transpose operation
Date : 2025-12-28 Size : 7kb User : kobe
[Data structs] Multiply DL : 0: 用动态规划算法实现的多段图程序，利用数组存储路径长度。-Dynamic programming algorithm using the multi-stage plan procedures, take advantage of an array of storage path length.
Date : 2025-12-28 Size : 1kb User : 杨文超
[Data structs] duoxiangshixiangcheng DL : 0: 可基本实现多项式的相乘，根据数据结构中的多项式相乘-Can basically achieve multiply polynomials, according to the data structure of polynomial multiplication
Date : 2025-12-28 Size : 1kb User : 王小米
[Data structs] homework2_2 DL : 0: 用链表(单向链表或双向链表)实现多项式之间的运算包括：多项式之间的加、减、乘、除*法等 -Use linked lists (one-way or two-way linked list) between the computing polynomial realize include: polynomial between the add, subtract, multiply, divide, etc.* Act
Date : 2025-12-28 Size : 35kb User : 云从龙
[Data structs] duoxiangshi DL : 0: 用c实现多项式的相加和相乘计算，很好用，可以在vc6.0环境下运行-Realize by c and multiply the sum of polynomial terms, very good use, you can run vc6.0 environment
Date : 2025-12-28 Size : 2kb User : 孙尚敏
[Data structs] dashuxiangcheng DL : 0: 面试经常遇到的大数相乘问题，代码简洁易懂-Interviews are often encountered in large numbers multiply problems, the code easier to understand
Date : 2025-12-28 Size : 395kb User : 姚天
[Data structs] excise2 DL : 0: 在数据结构中实现两个一元多项式的相加、相减和相乘-In the data structure of the polynomial realize one of the two together, subtract and multiply
Date : 2025-12-28 Size : 1kb User : berry

« 12 3 4 »