Polynomial_class.cpp

#include <bits/stdc++.h> 
#include<iostream>

using namespace std;

class Polynomial {
   public:
   int *degCoeff;      
   int capacity;

   public:
   Polynomial(){
       degCoeff=new int[10];
       for(int i=0;i<10;i++){
           degCoeff[i]=0;
       }
       capacity=10;
   }

   Polynomial(Polynomial const &d){
       this-> degCoeff=new int[d.capacity];
       for(int i=0;i<d.capacity;i++){
           this->degCoeff[i]=d.degCoeff[i];
       }
       this->capacity=d.capacity;
   }
   void setCoefficient(int deg,int coeff){
       if(deg>=capacity){
           int size=deg+1;
           int *newarr=new int[size];
           for(int i=0;i<capacity;i++){
               newarr[i]=this->degCoeff[i];
           }
           for(int i=capacity;i<size;i++){
               newarr[i]=0;
           }
           delete[] this->degCoeff;
           this->degCoeff=newarr;
           this->capacity=size;
       }
       this->degCoeff[deg]=coeff;
   }
   void print(){
       for(int i=0;i<capacity;i++){
           if(degCoeff[i]){
               cout<<degCoeff[i] <<  "x" <<i << " ";
           }
       }
       cout << endl;
   }
   Polynomial operator+(Polynomial &p){
       Polynomial newP;
       newP.capacity=max(p.capacity,capacity);
       newP.degCoeff=new int[newP.capacity];

       if(capacity<p.capacity){
           int k;
           for(k=0;k<capacity;k++){
                  newP.degCoeff[k]=degCoeff[k]+p.degCoeff[k];
           }
           for(;k<p.capacity;k++){
               newP.degCoeff[k]=p.degCoeff[k];
           }
       }
       else{
           int k;
           for(k=0;k<p.capacity;k++){
               newP.degCoeff[k]=degCoeff[k]+p.degCoeff[k];
           }
           for(;k<capacity;k++){
               newP.degCoeff[k]=degCoeff[k];
           }
       }
       return newP;
   }

   Polynomial operator-(Polynomial &p){
       Polynomial newP;
       newP.capacity = max(capacity, p.capacity);
       newP.degCoeff = new int[newP.capacity];
       if (capacity < p.capacity) {
         int k;
         for (k = 0; k < capacity; k++) {
           newP.degCoeff[k] = degCoeff[k] - p.degCoeff[k];
         }
         for (; k < p.capacity; k++) {
           newP.degCoeff[k] =-p.degCoeff[k];
         }
       } else {
         int k;
         for (k = 0; k < p.capacity; k++) {
           newP.degCoeff[k] = degCoeff[k] - p.degCoeff[k];
         }
         for (; k < capacity; k++) {
           newP.degCoeff[k] = degCoeff[k];
         }
       }
       return newP;
   }

   Polynomial operator*(Polynomial const &p){
     Polynomial newP;
     newP.capacity = p.capacity + capacity;
     newP.degCoeff = new int[newP.capacity];

     for(int i=0;i<newP.capacity;i++){
         newP.degCoeff[i]=0;
     }
     for(int i=0;i<capacity;i++){
       for (int j = 0; j < p.capacity; j++) {
         newP.degCoeff[i + j] += degCoeff[i] * p.degCoeff[j];
       }
     }
     return newP;
   }

   Polynomial operator=(Polynomial const &d){
       this->degCoeff=new int[d.capacity];
       for(int i=0;i<d.capacity;i++){
           this->degCoeff[i]=d.degCoeff[i];
       }
       this->capacity=d.capacity;
       return *this;
   }
};



int main() {
    int count1, count2, choice;
    cin >> count1;

    int * degree1 = new int[count1];
    int * coeff1 = new int[count1];

    for (int i = 0; i < count1; i++) {
        cin >> degree1[i];
    }

    for (int i = 0; i < count1; i++) {
        cin >> coeff1[i];
    }

    Polynomial first;
    for (int i = 0; i < count1; i++) {
        first.setCoefficient(degree1[i], coeff1[i]);
    }

    cin >> count2;

    int * degree2 = new int[count2];
    int * coeff2 = new int[count2];

    for (int i = 0; i < count2; i++) {
        cin >> degree2[i];
    }

    for (int i = 0; i < count2; i++) {
        cin >> coeff2[i];
    }

    Polynomial second;
    for (int i = 0; i < count2; i++) {
        second.setCoefficient(degree2[i], coeff2[i]);
    }

    cin >> choice;

    Polynomial result;
    switch (choice) {
        // Add
    case 1:
        result = first + second;
        result.print();
        break;
        // Subtract
    case 2:
        result = first - second;
        result.print();
        break;
        // Multiply
    case 3:
        result = first * second;
        result.print();
        break;

    case 4: // Copy constructor
    {
        Polynomial third(first);
        if (third.degCoeff == first.degCoeff) {
            cout << "false" << endl;
        } else {
            cout << "true" << endl;
        }
        break;
    }

    case 5: // Copy assignment operator
    {
        Polynomial fourth(first);
        if (fourth.degCoeff == first.degCoeff) {
            cout << "false" << endl;
        } else {
            cout << "true" << endl;
        }
        break;
    }

    }

    return 0;
}