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


/* I encode a monomial as an integer sequence.  Max length = 20.  I
   can enlarge this later on. */


public class Monomial {
    int[] x=new int[60];     //variables
    int coeff;                      //coefficient
    int wrap;                 //variable wrap;
    int dead;

    /* initializes as the zero monomial */

    public Monomial() {
       for(int i=0;i<60;++i) x[i]=0;
       coeff=0;
       wrap=40;
       dead=0;
    }

    /* copying */

    public static Monomial copy(Monomial M) {
	Monomial X=new Monomial();
       for(int i=0;i<M.wrap;++i) X.x[i]=M.x[i];
       X.wrap=M.wrap;
       X.coeff=M.coeff;
       return(X);
    }


    //coeff, variables, exponents, number of terms,wrap

    public static Monomial make(int c,int[] k1,int[] k2,int count,int w) {
	Monomial M=new Monomial();
	M.coeff=c;
	M.wrap=w;
	for(int i=0;i<count;++i) {
	    M.x[k1[i]]=k2[i];
	}
	return(M);
    }

  //coeff, variables, number of terms,wrap
    public static Monomial make(int c,int[] k1,int count,int w) {
	Monomial M=new Monomial();
	M.coeff=c;
	M.wrap=w;
	for(int i=0;i<count;++i) {
	    M.x[k1[i]]=1;
	}
	return(M);
    }





    //print routine

    public void print() {
	System.out.print(coeff+" ");
	for(int i=0;i<60;++i) {
	    if(x[i]!=0) System.out.print("["+i+"]^"+x[i]+" ");
	}
	System.out.println();
    }

    public void print2() {
	System.out.print(coeff+" ");
	for(int i=0;i<60;++i) {
	    if(x[i]!=0) System.out.print("x"+i+" ");
	}
    }





    // product

    public static Monomial times(Monomial m1,Monomial m2) {
	Monomial m3=new Monomial();
	m3.coeff=m1.coeff*m2.coeff;
	for(int i=0;i<60;++i) {
	    m3.x[i]=m1.x[i]+m2.x[i];
	}
	return(m3);
    }

    public int degree() {
	int total=0;
	for(int i=0;i<60;++i) {
	    total=total+x[i];
	}
	return(total);
    }

    public Monomial divide(int i) {
	Monomial M=copy(this);
	--M.x[i];
	return(M);
    }


    public double evaluate(double[] d) {
	double value=coeff;
	for(int i=0;i<wrap;++i) {
	    value=value*Math.pow(d[i],x[i]);
	}
	return(value);
    }



    public static int match(Monomial m1,Monomial m2) {
	if(m1.wrap!=m2.wrap) return(0);
	for(int i=0;i<m1.wrap;++i) {
	    if(m1.x[i]!=m2.x[i]) return(0);
	}
	return(1);
    }

}