Description: Programming seeking the product of two one-polynomial. Enter the input data for the two lines represent two unary polynomial. One dollar for each polynomial order of the exponential increase of the input polynomial coefficients (integer), index (integer). For example: 1+2 x+ x2 expressed as: " 1,0" , " 2,1" , " 1,2" , the output of the order of the exponential increase output of the product: " coefficient, index" , " coefficient, index" , " coefficient, the index " , zero polynomial output format is:" 0,0 " ,
To Search:
- [Joseph] - Two-way Joseph problems, using two-way t
- [shuikeng] - Have a puddle, from the cross-section vi
File list (Check if you may need any files):
一元多项式相乘\Debug\一元多项式相乘.exe
..............\.....\一元多项式相乘.ilk
..............\.....\一元多项式相乘.pdb
..............\一元多项式相乘\Debug\BuildLog.htm
..............\..............\.....\mt.dep
..............\..............\.....\vc90.idb
..............\..............\.....\vc90.pdb
..............\..............\.....\一元多项式相乘.exe.intermediate.manifest
..............\..............\.....\一元多项式相乘.obj
..............\..............\一元多项式相乘.cpp
..............\..............\一元多项式相乘.vcproj
..............\..............\一元多项式相乘.vcproj.lenovo-PC.lenovo.user
..............\一元多项式相乘.ncb
..............\一元多项式相乘.sln
..............\一元多项式相乘.suo
..............\..............\Debug
..............\Debug
..............\一元多项式相乘
一元多项式相乘
Download