多项式四则运算

多项式四则运算运行图：源代码：// 多项式加减乘除-02.cpp : 定义控制台应用程序的入口点。

//#include "stdafx.h"int _tmain(int argc, _TCHAR* argv[]){return 0;}#include<stdio.h>#include<malloc.h>typedef struct Polynomial{float coef;int expn;struct Polynomial *next;}*Polyn,Polynomial;void Insert(Polyn p,Polyn h){if(p->coef==0)free(p);else{Polyn q1,q2;q1=h;q2=h->next;while(q2&&p->expn<q2->expn){q1=q2;q2=q2->next;}if(q2&&p->expn==q2->expn){q2->coef+=p->coef;free(p);if(!q2->coef){q1->next=q2->next;free(q2);}}else{p->next=q2;q1->next=p;}}}Polyn CreatePolyn(Polyn head,int m){int i;Polyn p;p=head=(Polyn)malloc(sizeof(struct Polynomial));head->next=NULL;for(i=0;i<m;i++){p=(Polyn)malloc(sizeof(struct Polynomial));printf("请输入第%d项的系数与指数:",i+1);scanf_s("%f %d",&p->coef,&p->expn);Insert(p,head);}return head;}void DestroyPolyn(Polyn p){Polyn q1,q2;q1=p->next;q2=q1->next;while(q1->next){free(q1);q1=q2;q2=q2->next;}}void PrintPolyn(Polyn P){Polyn q=P->next;int flag=1;if(!q){putchar('0');printf("\n");return;}while (q){if(q->coef>0&&flag!=1)putchar('+');if(q->coef!=1&&q->coef!=-1){printf("%g",q->coef);if(q->expn==1) putchar('X');elseif(q->expn)printf("X^%d",q->expn);}else{if(q->coef==1){if(!q->expn)putchar('1');else if(q->expn==1)putchar('X');else printf("X^%d",q->expn);}if(q->coef==-1){if(!q->expn)printf("-1");else if(q->expn==1)printf("-X");else printf("-X^%d",q->expn);}}q=q->next;flag++;}printf("\n");}int compare(Polyn a,Polyn b){if(a&&b){if(!b||a->expn>b->expn)return 1;elseif(!a||a->expn<b->expn)return -1;elsereturn 0;}else if(!a&&b)return -1;elsereturn 1;}Polyn AddPolyn(Polyn pa,Polyn pb){Polyn qa=pa->next;Polyn qb=pb->next;Polyn headc,hc,qc;hc=(Polyn)malloc(sizeof(struct Polynomial));hc->next=NULL;headc=hc;while(qa||qb){qc=(Polyn)malloc(sizeof(struct Polynomial));switch(compare(qa,qb)){case 1:{qc->coef=qa->coef;qc->expn=qa->expn;qa=qa->next;break;}case 0:{qc->coef=qa->coef+qb->coef;qc->expn=qa->expn;qa=qa->next;qb=qb->next;break;}case -1:{qc->coef=qb->coef;qc->expn=qb->expn;qb=qb->next;break;}}if(qc->coef!=0){qc->next=hc->next;hc->next=qc;hc=qc;}else free(qc);}return headc;}Polyn SubtractPolyn(Polyn pa,Polyn pb){Polyn h=pb;Polyn p=pb->next;Polyn pd;while(p){p->coef*=-1;p=p->next;}pd=AddPolyn(pa,h);for(p=h->next;p;p=p->next)p->coef*=-1;return pd;}float ValuePolyn(Polyn head,float x){Polyn p;int i;float sum=0,t;for(p=head->next;p;p=p->next){t=1;for(i=p->expn;i!=0;){if(i<0){t/=x;i++;}else{t*=x;i--;}}sum+=p->coef*t;}return sum;}Polyn MultiplyPolyn(Polyn pa,Polyn pb){Polyn hf,pf;Polyn qa=pa->next;Polyn qb=pb->next;hf=(Polyn)malloc(sizeof(struct Polynomial));hf->next=NULL;for(;qa;qa=qa->next){for(qb=pb->next;qb;qb=qb->next){pf=(Polyn)malloc(sizeof(struct Polynomial));pf->coef=qa->coef*qb->coef;pf->expn=qa->expn+qb->expn;Insert(pf,hf);}}return hf;}#include<stdlib.h>#include<stdio.h>#include<malloc.h>struct list{int zhishu;int xishu;struct list *next;};typedef struct list node; typedef node *link;void free_list(link head){link pointer;while(head!=NULL){pointer=head;head=head->next;free(pointer);}}link rev(link head){link p1,p2;p1=head->next;p2=p1->next;p1->next=NULL;while(p2!=NULL){head->next=p2;p2=p2->next;head->next->next=p1;p1=head->next;}return head;}link find_list(link head,int key) {link p0;p0=head->next;while(p0!=NULL){return p0;p0=p0->next;}return p0;}link find2_list(link head,int key){link p0;p0=head;while(p0!=NULL){if((p0->next->zhishu==key)&&(p0->next->xishu!=0)) return p0;p0=p0->next;}return p0;}link clearzero(link head){link p0,pp;p0=head;while(p0!=NULL){if((p0->next->xishu==0)&&(p0->next->zhishu!=0)){pp=p0->next;p0->next=pp->next;free(pp);}p0=p0->next;}return head;}int max_list(link head1,link head2){link p1;link p2;int temp=-10000;p1=head1->next;p2=head2->next;while(p1!=NULL){if(p1->zhishu>temp)p1=p1->next;};while(p2!=NULL){if(p2->zhishu>temp)temp=p2->zhishu;p2=p2->next;};return temp;}link add_list(link head1,link head2){link pointer1;link pointer2;link pointer3;link new1;link new2;link head3;int a=0;int i=0;head3=(link)malloc(sizeof(node));if(head3==NULL){printf("Memory allocate Failure!\n");}else{head3->next=NULL;head3->zhishu=0;head3->xishu=0;};pointer1=head1->next;pointer2=head2->next;pointer3=head3;if((pointer1->zhishu)>=(pointer2->zhishu)){i=pointer2->zhishu;}else{i=pointer1->zhishu;};while(1){if(i>max_list(head1,head2))break;a=0;if(find_list(head1,i)!=NULL){new2=find_list(head1,i);a=a+new2->xishu;};if(find_list(head2,i)!=NULL){new2=find_list(head2,i);a=a+new2->xishu;};if(a!=0){new1=(link)malloc(sizeof(node));new1->zhishu=i;new1->xishu=a;new1->next=NULL;pointer3->next=new1;pointer3=new1;};i=i+1;};return head3;}link init_list(link head){head=(link)malloc(sizeof(node));if(head==NULL)printf("Memory allocate Failure!\n");else{head->next=NULL;head->zhishu=0;head->xishu=0;}return head;}link jianfa(link head11,link head22){link p2;p2=head22->next;while(p2!=NULL){p2->xishu=(-1)*(p2->xishu);p2=p2->next;}return add_list(head11,head22);}link chufa(link head1,link head2){link head3=NULL,tp,new1,p3,p2,new2;link temp=NULL;head3=(link)malloc(sizeof(node));head3->next=NULL;head3->zhishu=0;head3->xishu=0;temp=(link)malloc(sizeof(node));temp->next=NULL;temp->zhishu=0;temp->xishu=10;init_list(head3);init_list(temp);p3=head3;while(1){if((head1->next->zhishu)<(head2->next->zhishu)){p3->next=head1;break;};new1=(link)malloc(sizeof(node));new1->zhishu=(head1->next->zhishu)-(head2->next->zhishu);new1->xishu=(head1->next->xishu)/(head2->next->xishu);new1->next=NULL;p3->next=new1;p3=new1;tp=temp;p2=head2->next;while(p2!=NULL){if((p2->xishu==0)&&(p2->zhishu==0)){break;};new2=(link)malloc(sizeof(node));new2->zhishu=p2->zhishu+p3->zhishu ;new2->xishu=(p2->xishu)*(p3->xishu) ;new2->next=NULL;tp->next=new2;tp=new2;p2=p2->next;};head1=jianfa(rev(head1),rev(temp));head1=rev(head1);free_list(temp->next);temp->next=NULL;};return head3 ;}link chengfa(link head1,link head2){link p1,p2,p3,new1,p,tp,p31;link head3=NULL;head3=(link)malloc(sizeof(node));if(head3==NULL){printf("Memory allocate Failure!\n");}else{head3->next=NULL;head3->zhishu=0;head3->xishu=0;};p1=head1->next;p2=head2->next;p3=head3;while(p1!=NULL){p2=head2->next;while(p2!=NULL){new1=(link)malloc(sizeof(node));new1->zhishu=p1->zhishu+p2->zhishu;new1->xishu=(p1->xishu)*(p2->xishu);new1->next=NULL;p3->next=new1;p3=new1;p2=p2->next;}p1=p1->next;}p3=head3->next;while(p3!=NULL){p=p3;p31=p3;while(p31!=NULL){if(find2_list(p31,p->zhishu)!=NULL){new1=find2_list(p31,p->zhishu);p->xishu=p->xishu+new1->next->xishu;tp=new1->next;new1->next=tp->next;free(tp);};p31=p31->next;};p3=p3->next;};return clearzero(head3);}void print_list(link head){link pointer;pointer=head->next;printf(" ");while(pointer!=NULL){printf("%d x^%d ",pointer->xishu,pointer->zhishu);if(pointer->next!=NULL)printf("+");pointer=pointer->next;}printf("\n");}/*****************************************************/ /*void print_list(link head){link pointer;pointer=head->next;printf("(zhishu , xishu)\n");while(pointer!=NULL){printf("%d , %d\n",pointer ->zhishu,pointer->xishu);pointer=pointer->next;}printf("\n"); }/*****************************************************/ link create_list(link head){link new1;link pointer;head=(link)malloc(sizeof(node));if(head==NULL)printf("Memory allocate Failure!\n");else{head->next=NULL;head->zhishu=0;head->xishu=0;pointer=head;while(1){new1=(link)malloc(sizeof(node));printf("输入指数和系数:");scanf_s("%d %d",&(new1->zhishu),&(new1->xishu));if (new1->xishu==0){printf("多项式输入完毕。