//POLYNOMLIAL 구현 실습
#include <vector>
#include <algorithm>
#include <iostream>
#include <stdlib.h>

using namespace std;

class Polynomial;

class Term
{
 friend Polynomial;
private:
 float coef;
 int exp;
};

class Polynomial {
public:
 Polynomial();
 //construct the polynomial p(x) = 0;

 Polynomial Add(Polynomial b);
 //return the sum of the polynomials *this and b

 void NewTerm(const float theCoeff, const int theExp);
 int Display();
 int GetData();
private:
 static Term* termArray;
 static int capacity;
 static int free;
 int start, finish;
 int terms;
};
Polynomial::Polynomial()
{

}
int Polynomial::Display() {

 return 0;
}
//Program 2.9: Adding a new term
void Polynomial::NewTerm(const float theCoeff, const int theExp)
{
 if (terms == capacity)
 {
  capacity *= 2;
  Term* temp = new Term[capacity];
  copy(termArray, termArray + free, temp);
  delete[] termArray;
  termArray = temp;
 }
 termArray[free].coef = theCoeff;
 termArray[free++].exp = theExp;
}

int Polynomial::GetData() {
 int i, degree;
 float coef;
 int expo;
//난수 생성하여 지수와 계수를 입력, 0<= 지수 <= 5, 0<= 계수 < 100
 finish = free - 1;
 terms = finish - start + 1;
 return 0;
}

//program 2.8: Adding two polynomials
//교재 91 페이지 내용과 다른 코드 확인하기
Polynomial Polynomial::Add(Polynomial b)
{

 return c;
}

int main(void) {
 int choice;

 Polynomial P1, P2, P3, P4;

 }
 system("pause");
 return 0;
}