c语言二项式运算代码.docVIP

c语言二项式运算代码 #include stdio.h #include malloc.h #include math.h typedef struct poly { int coef; int expn; struct poly *prior; struct poly *next; }; poly *initpoly()/*初始化链表*/ { poly *p; p=(poly*)malloc(sizeof(poly)); p-next=NULL; return p; }; poly *creat_poly(poly *p)/*存列表*/ { int i=0,n=0; poly *p1; p=initpoly(); printf(请输入二项式的项数); scanf(%d,n); for(i=0;in;i++) { p1=(poly*)malloc(sizeof(poly)); printf(请输入第%d项的系数,i+1); scanf(%d,p1-coef); printf(请输入第%d项的指数,i+1); scanf(%d,p1-expn); p1-next=p-next; p-next=p1; } return p; } void destroy_link(poly *p)/*销毁列表*/ { poly *q; while(p != NULL) { q = p; p = p-next; free(q); } } poly *delpoly(poly *h,poly *del)/*删除节点*/ { poly *t; t=h; while(t-next!=del) t=t-next; t-next=del-next; del-next=NULL; return h; } poly *locate_link(poly *p, int index)/*找位置*/ { p = p-next; while(p != NULL p-expn != index) p = p-next; if(p == NULL) return NULL; else return p; } poly *order_poly(poly *h)/*排序*/ { poly *temp1,*temp2,*t; int i,j; t=h; for(i=0;t-next!=NULL;(t=t-next,i++)); for(j=0;ji-1;j++) { t=h; while(t-next-next) { if(t-next-next-expnt-next-expn) { temp1=t-next; temp2=t-next-next; t-next=temp2; temp1-next=temp2-next; temp2-next=temp1; } t=t-next; } } return h; } poly display_poly(poly *p) { int a,b=0; p=order_poly(p); for(;p-next!=NULL;) { p=p-next; a = 1; if(p-coef 0) a = 0; a ? printf( +): printf( ); printf(%dx^%d, p-coef,p-expn); } printf(\n); } poly *poly_qiuzhi(poly *head) { poly *p=head; int i,num=0; scanf(%d,i); getchar(); while(p-next!=NULL) { p=p-next; num=num+p-coef*(pow(i,p-expn)); } printf(所求值为%d,num); } poly *poly_qiudao(poly *head) { poly *p=head,*p2,*r; r=p; while(r-next!=NULL) { r=r-next; r-coef=r-coef*r-expn; r-expn=r-expn-1; } return p; } poly * poly_add(poly *head1, poly *head2, char a) { char ch,cn; poly *p1, *p2, *p, *r;p1 = head1; p2 = head2; r = p1; while(r-next != NULL) { p1 = r-next; r