Description: , 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.
To Search:
File list (Check if you may need any files):
新建文件夹 (2)\main.cpp
..............\Project1.dev
..............\Makefile.win
..............\main.o
..............\Project1.exe
..............\数据.txt
新建文件夹 (2)
Download