import java.applet.Applet;
import java.awt.event.*;
import java.awt.*;


/* I encode a polynomial as a finite list of monomials.  This is meant to be
   the sum.  Number of terms*/


public class Polynomial {
    Monomial[] m=new Monomial[5000];     //variables
    int count;

    /* initializes as the zero monomial */

    public Polynomial() {
	for(int i=0;i<5000;++i) m[i]=new Monomial();
    }


    public static Polynomial make(Monomial[] M,int cc) {
	 Polynomial P=new Polynomial();
	 P.count=cc;
	 for(int i=0;i<cc;++i) P.m[i]=M[i];
	 return(P);
    }

    public double evaluate(double[] d) {
	double total=0;
	for(int i=0;i<count;++i) {
	    total=total+m[i].evaluate(d);
	}
	return(total);
    }

    public double randomEvaluate() {
	double[] d=new double[50];
	for(int i=0;i<50;++i) d[i]=Math.random();
	double total=evaluate(d);
	return(total);
    }


    public Polynomial reduce() {

	Polynomial P=new Polynomial();
	for(int i=0;i<count;++i) P.m[i]=Monomial.copy(m[i]);
	P.count=this.count;

	for(int i=0;i<P.count;++i) {
	    if(P.m[i].dead==0) {
	      for(int j=i+1;j<P.count;++j) {
		  int test=Monomial.match(P.m[i],P.m[j]);

		  if(test==1) {
		      P.m[j].dead=1;
		      P.m[i].coeff=P.m[i].coeff+P.m[j].coeff;
		  }
	      }
	    }
	}

	Polynomial Q=new Polynomial();
	int COUNT=0;
	for(int i=0;i<P.count;++i) {
	    if((P.m[i].coeff!=0)&&(P.m[i].dead==0)) {
		Q.m[COUNT]=Monomial.copy(P.m[i]);
		++COUNT;
	    }
	}
	Q.count=COUNT;
	return(Q);
    }




    public void print() {
	System.out.println("**poly**");
	for(int i=0;i<count;++i) {
	    m[i].print();
	}	
        System.out.println("******");
    }

    public void print2() {
	for(int i=0;i<count;++i) {
	    m[i].print2();
	    if(i<count-1)  System.out.print("+ ");
	}	
	System.out.println(");");
    }





    public Polynomial mask(int[] u,int length) {
	Polynomial P=new Polynomial();
	P.count=length;
	for(int i=0;i<length;++i) {
          P.m[i]=Monomial.copy(m[u[i]]);
	}
	return(P);
    }





}