#include <stdio.h>
struct list {
  int pow,coef;
  struct list *next;
};
typedef struct list node;
typedef node *link;
void print_poly(link head) {
  link pt1;
  printf("the input polynomial ---> f(X)=");
  pt1=head;
  while (pt1 != NULL) {
    if (pt1->pow != 0) printf("%2dX%2d",pt1->coef,pt1->pow);
    else printf("%2d",pt1->coef);
    pt1=pt1->next; if (pt1 != NULL) printf("+");
  }
  printf("\n");
}

link inverse(link p1) {
 link p3,p2;
 p2=NULL;
 while (p1 != NULL) {
   p3=p2; p2=p1; p1=p1->next; p2->next=p3;
 }
 return p2;
}

link create() {
  int c,p;
  link head,pt1,pt2;

  head=NULL;
  while (1) {
    printf("give me coefficient and power ?"); scanf("%d %d",&c,&p);
    if ((c == 0) && (p == 0)) break;
    pt2=(link)malloc(sizeof(node)); pt2->next=NULL;
    if (head == NULL) pt1=head=pt2;
    else pt1=pt1->next=pt2;
    pt2->coef=c; pt2->pow=p;
  }
  return head;
}

void main() {
  link h1;

  printf("give me the first poly -->");  h1=create(); print_poly(h1);
  h1=inverse(h1); print_poly(h1); 
}