void Polynomial::normalize $()$

$\{$

if $($degree $<0)$

$\{$

terms.clear$()$;

return;

$\}$

std::list::iterator it $=$ terms.begin$()$;

while $($it $!=$ terms.end$())$

$\{$

if $($it$->$coefficient $==0)$

it $=$ terms.erase$($it$)$;

else

$++$it;

$\}$

if $($terms$.$begin$()!=$ terms.end$())$

degree $=$ terms.back$().$power;

else

degree $=0$;

$\}$

Polynomial::Polynomial $()$

: degree$(-1),$ coefficients$($nullptr$)$

$\{$

$\}$

Polynomial::Polynomial $($int b$,$ int a$)$

: degree$(1),$ coefficients$($new int$[2])$

$\{$

coefficients$[0]=$ b;

coefficients$[1]=$ a;

normalize$()$;

$\}$

Polynomial::Polynomial $($Term term$)$

: degree$($term$.$power$),$ coefficients$($new int$[$term$.$power$+1])$

$\{$

for $($int i $=0$; i $<$ degree; $++$i$)$

coefficients$[$i$]=0$;

coefficients$[$degree$]=$ term.coefficient;

normalize$()$;

$\}$

Polynomial::Polynomial $($int nC$,$ int coeff$[])$

: degree$($nC$-1),$ coefficients$($new int$[$nC$])$

$\{$

for $($int i $=0$; i $<=$ degree; $++$i$)$

coefficients$[$i$]=$ coeff$[$i$]$;

normalize$()$;

$\}$

void Polynomial::normalize $()$

$\{$

while $($degree$+1>1$ && coefficients$[$degree$]==0)$

$--$degree;

$\}$

int Polynomial::getDegree$()$ const

$\{$

return degree;

$\}$

int Polynomial::getCoeff$($int power$)$ const

$\{$

if $($power $>=0$ && power $<=$ degree$)$

$\{$