package eg.edu.alexu.csd.datastructure.linkedList.cs15_cs36;
import java.util.*;
public class Try {


	public static void main(String[] args) {
		/*LinkedList <Integer> k=new LinkedList <>();
		DoubleLinkedList l=new DoubleLinkedList();
		DoubleLinkedList sub=new DoubleLinkedList();
		l.add(5);
		l.add(7);
		l.add(8);
		l.add(9);
		l.add(5);
		l.add(3);
		l.add(4);
		l.set(0, 1000);
		/*System.out.println(l.sublist(2, 2).size());*/
		/*sub.print();
		l.print();


		Scanner s= new Scanner (System.in);
		char poly =s.next().charAt(0);
		int no =s.nextInt();
		int [][] terms =new int [no][2];
		int x;
		for (int i=0;i<no;i++) {
			for (int j=0;j<2;j++) {
				x=s.nextInt();
				terms[i][j]=x;
			}
		}

		Polynomial u=new Polynomial();
		u.setPolynomial('A',  terms);

		System.out.println( u.print('A'));
		int [][] terms2 =new int [no][2];
		for (int i=0;i<no;i++) {
			for (int j=0;j<2;j++) {
				x=s.nextInt();
				terms2[i][j]=x;
			}
		}

		u.setPolynomial('B',  terms2);
		System.out.println( u.print('A'));
		System.out.println( u.print('B'));
		u.setPolynomial('R', u.add('A', 'B'));
		System.out.println( u.print('R'));
		u.multiply('A', 'B');
		Polynomial.clearPolynomial(poly);
		/*for (int i=0;i<no;i++) {
			for (int j=0;j<2;j++) {
				System.out.println(terms[i][j]);
			}
		}*/
		 IPolynomialSolver u=new Polynomial();
	     int[][] terms={{0,0}};
	     int[][] terms2={{1,3},{1,2},{2,0}};
	     u.setPolynomial('A', terms);
	     u.setPolynomial('B', terms2);
	     u.add('A', 'B');
	     /*u.setPolynomial('R', u.add('A', 'B'));
	     u.print('R');*/
	}

}