Создание библиотеки для работы с полиномами

class Polynomial {
  std::vector<double> a_;
public:
  Polynomial() { /*...*/ };
  double a(size_t i) const { return a_[i]; };
  double f(double x) const {
    double s=0.0;
    double xx=1.0;
    for(size_t i=0; i<a_.size(); ++i) {
      s+=a_[i]*xx;
      xx*=x;
    }
    return s;
  }
  /* ... */
};

#include <stdio.h>
#include <math.h>
 
// [url]https://www.cyberforum.ru/cpp-beginners/thread1684390.html[/url]
 
class polynom_node
{
public:
int power;
float value;
polynom_node* next;
 
polynom_node()
{
next = 0;
power = 0;
value = 0.0f;
}
 
polynom_node(int pw, float vl)
{
next = 0;
power = pw;
value = vl;
}
 
~polynom_node()
{
if(next)
{
delete next;
next = 0;
}
}
 
void add_next(int pw, float vl)
{
polynom_node* i = this;
while(i->next!=0)
i=i->next;
i->next = new polynom_node(pw,vl);
}
 
void print()
{
polynom_node* i = this;
while(i->next!=0)
{
printf("%d %f\n", i->power, i->value);
i=i->next;
}
printf("%d %f\n", i->power, i->value);
}
 
};
 
class polynom
{
public:
polynom_node* n;
 
polynom() 
{
n = new polynom_node(0,0);
}
 
polynom(int pw, float vl)
{
n = new polynom_node(pw,vl);
}
 
~polynom()
{
delete n;
n = 0;
}
 
void add(int pw, float vl)
{
n->add_next(pw, vl);
}
 
void print()
{
n->print();
}
 
void val_arg(float x)
{
float result = 0.0;
polynom_node* i = n;
while(i->next != 0)
{
result += i->value * pow(x, i->power);
i=i->next;
}
result += i->value * pow(x, i->power);
printf("val_arg: %f\n", result);
}
 
void f1(polynom* m, int md)
{
int bl;
polynom_node* i = n;
polynom_node* j = m->n;
while(i->next != 0)
{
bl = 0;
while (j->next != 0 && bl == 0)
{
if (i->power == j->power)
{
if (md==0)
i->value += j->value;
else if (md==1)
i->value -= j->value;
bl = 1;
}
j=j->next;
}
if (i->power == j->power)
{
if (md==0)
i->value += j->value;
else if (md==1)
i->value -= j->value;
bl = 1;
}
i=i->next;
}
bl = 0;
while (j->next != 0 && bl == 0)
{
if (i->power == j->power)
{
if (md==0)
i->value += j->value;
else if (md==1)
i->value -= j->value;
bl = 1;
}
j=j->next;
}
if (i->power == j->power)
{
if (md==0)
i->value += j->value;
else if (md==1)
i->value -= j->value;
bl = 1;
}
while(j->next != 0)
{
bl = 0;
while (i->next != 0 && bl == 0)
{
if (i->power == j->power)
bl = 1;
i=i->next;
}
if (i->power == j->power)
bl = 1;
if(bl==0)
add(j->power, j->value);
i=i->next;
}
bl = 0;
while (i->next != 0 && bl == 0)
{
if (i->power == j->power)
{
bl = 1;
}
i=i->next;
}
if (i->power == j->power)
{
bl = 1;
}
if(bl==0)
add(j->power, j->value);
}
 
 
 
 
void addpw(int pw, float vl)
{
int bl = 0;
polynom_node* i = n;
 
while(i->next != 0)
{
if (i->power == pw)
{
i->value += vl;
bl = 1;
}
i=i->next;
}
 
if (i->power == pw)
{
i->value += vl;
bl = 1;
}
if (bl == 0) 
add(pw, vl);
}
 
 
 
void addpw0(int pw, float vl)
{
int bl = 0;
polynom_node* i = n;
while(i->next != 0)
{
if (i->power == pw)
{
i->value = vl;
bl = 1;
}
i=i->next;
}
if (i->power == pw)
{
i->value = vl;
bl = 1;
}
if (bl == 0)
add(pw, vl);
}
 
 
 
void operator+(polynom* m)
{
f1(m, 0);
}
 
void operator-(polynom* m)
{
f1(m, 1);
}
 
 
void operator*(polynom* m)
{
polynom* temp = new polynom();
int bl;
polynom_node* i = n;
polynom_node* j = m->n;
int temp_power;
float temp_value;
 
while(i->next != 0)  
{
j = m->n;
temp_power = i->power;
temp_value = i->value;
while(j->next != 0)
{
temp_power += j->power;
temp_value *= j->value;
temp->addpw(temp_power, temp_value);
temp_power = i->power;
temp_value = i->value;
j = j->next;
}
 
temp_power += j->power;
temp_value *= j->value;
temp->addpw(temp_power, temp_value);
temp_power = i->power;
temp_value = i->value;
 
i = i->next;
}
 
 
 
j = m->n;
temp_power = i->power;
temp_value = i->  value;
while(j->next != 0)
{
temp_power += j->power;
temp_value *= j->value;
temp->addpw(temp_power,temp_value);
temp_power = i->power;
temp_value = i->value;
j = j->next;
}
 
temp_power += j->power;
temp_value *= j->value;
temp->addpw(temp_power,temp_value);
temp_power = i->power;
temp_value = i->value;
 
temp->print();
polynom_node* k = temp->n;
while(k->next != 0)
{
addpw0(k->power, k->value);
k = k->next;
}
addpw0(k->power, k->value);
delete temp;
}
 
 
};
 
 
void main()
{
 
polynom* n = new polynom(0,5);
n->add(1,2);
n->add(2,3);
n->print();
 
n->val_arg(1.0);
 
polynom* m = new polynom(0,6);
m->add(1,7);
m->add(2,9);
m->print();
 
//n->operator+(m); n->print();
 
n->operator*(m);
n->print();
 
}