Devc
所属分类:其他小程序
开发工具:C/C++
文件大小:121KB
下载次数:5
上传日期:2010-12-27 00:36:28
上 传 者:马萌
说明: 、一元多项式的加法、减法、乘法的实现
【问题描述】
设有一元多项式Am(x)和Bn(x),
  Am(x)=A0+A1x1+A2x2+A3x3+… +Amxm
  Bn(x)=B0+B1x1+B2x2+B3x3+… +Bnxn
  请实现求M(x)= Am(x)+Bn(x)、M(x)= Am(x)-Bn(x)和M(x)= Am(x)×Bn(x)。
【基本要求】
首先判定多项式是否稀疏;
分别采用顺序和动态存储结构实现;
结果M(x)中无重复阶项和无零系数项;
要求输出结果的升幂和降幂两种排列情况
【进一步完成内容】
界面设计的优化。
(, A polynomial of addition, subtraction, multiplication problems to achieve 【Description】 There is a polynomial Am (x) and Bn (x), Am (x) = A0+ A1x1+ A2x2+ A3x3+ ...+ Amxm Bn ( x) = B0+ B1x1+ B2x2+ B3x3+ ...+ Bnxn please realize find M (x) = Am (x)+ Bn (x), M (x) = Am (x)-Bn (x) and M (x) = Am (x) × Bn (x). First determine the basic requirements of】 【polynomial is sparse were used to achieve sequential and dynamic storage structure result M (x) in the non-repeat-order items and non-zero coefficient term required output of both ascending and descending order situation 【Content】 interface complete further design optimization.)
文件列表:[举报垃圾]
新建文件夹 (2)
..............\main.cpp,19123,2010-12-27
..............\main.o,16254,2010-12-27
..............\Makefile.win,899,2010-12-27
..............\Project1.dev,832,2010-12-27
..............\Project1.exe,486976,2010-12-27
..............\数据.txt,16605,2010-10-07
近期下载者:
相关文件:
收藏者: