文件名称:plus1122
介绍说明--下载内容均来自于网络,请自行研究使用
1问题描述:
设计一个实现稀疏多项式乘法的程序
2需求分析:
编程实现两个一元多项式相乘,要求:
2.1输入并建立多项式;
2.2输出多项式,输出形式为整数序列:n,c1,e1,c2,e2``````,cn.,en,其中n是多项式的系数,ci和ei分别是第i项的系数和指数,序列按指数降序排列。
2.3多项式a和b相乘,建立结果多项式a*b
-a Problem descr iption : Design a sparse polynomial multiplication achieve the two procedures demand analysis : Programming 2 1 yuan polynomial multiplication, requirements : 2.1 to import and establish polynomial; 2.2 Output polynomial, Output form of integer sequence : n, c1, e1, c2, e2 ``````, cn. , en, where n is the polynomial coefficients, respectively ei ci and is the first item i coefficient and the index sequence index in descending order. 2.3 polynomial multiplication a and b, the results establish a* b polynomial
设计一个实现稀疏多项式乘法的程序
2需求分析:
编程实现两个一元多项式相乘,要求:
2.1输入并建立多项式;
2.2输出多项式,输出形式为整数序列:n,c1,e1,c2,e2``````,cn.,en,其中n是多项式的系数,ci和ei分别是第i项的系数和指数,序列按指数降序排列。
2.3多项式a和b相乘,建立结果多项式a*b
-a Problem descr iption : Design a sparse polynomial multiplication achieve the two procedures demand analysis : Programming 2 1 yuan polynomial multiplication, requirements : 2.1 to import and establish polynomial; 2.2 Output polynomial, Output form of integer sequence : n, c1, e1, c2, e2 ``````, cn. , en, where n is the polynomial coefficients, respectively ei ci and is the first item i coefficient and the index sequence index in descending order. 2.3 polynomial multiplication a and b, the results establish a* b polynomial
(系统自动生成,下载前可以参看下载内容)
下载文件列表
相乘
....\duoxiangshi.doc
....\xiangcheng.cpp
....\duoxiangshi.doc
....\xiangcheng.cpp