一元多项式运算

6. #include<iostream>
7. #include<malloc.h>
8. #include<stdlib.h>
9. using namespace std;
10. #define OK 1
11. #define ERROR 0
12. #define OVERFLOW -2
14. typedef struct polyn
15. {
16.      float coef;
17.      int expn; 
18.      struct polyn *next;
19. }Elem,*polynomial;
21. void CreatPolyn(polynomial &p,int n)         //创建多项式 
22. {
23.      p=(polynomial)malloc(sizeof(Elem));
24.      p->expn=-1;
25.      p->next=NULL;
26.      polynomial q=p,r;
27.      for(int i=0;i<n;i++)
28.      {
29.         q=(polynomial)malloc(sizeof(Elem));
30.         cin>>q->coef>>q->expn;
31.         if(!i) {p->next=q;r=q;}
32.         else   {r->next=q;r=q;}
33.      }
34.      q->next=NULL;
35.      }
37. void Sort(polynomial &p,int n)           //排序 
38. {
39.      polynomial q,r,t;
40.      int j;
41.      bool change=true;
42.      for(int i=n-1;i>0&&change;i--)
43.      {
44.         change=false;
45.         for(r=p,q=p->next,j=0;q->next&&j<i;j++)
46.         if(q->expn>q->next->expn) {
47.                                   r->next=q->next;
48.                                   t=q->next->next;
49.                                   q->next->next=q;
50.                                   q->next=t;
51.                                   change=true;
52.                                   r=r->next;}
53.         else{r=q;q=q->next;}
54.         }
55. }
57. void PrintPolyn(polynomial p)          //输出 
58. { 
59.      while(p=p->next)
60.      cout<<p->coef<<" "<<p->expn<<endl;
61.      cout<<endl;
62.      }
64. void AddPolyn(polynomial &La,polynomial &Lb)        //加法 
65. {
66.       polynomial qa=La->next,qb=Lb->next,qqa=La,t;
67.       while(qa&&qb)                           
68.         { if(qb->expn>qa->expn) {qqa=qa;qa=qa->next;}
69.           else  if(qb->expn<qa->expn) {
70.               qqa->next=qb;
71.               t=qb;
72.               qb=qb->next;
73.               t->next=qa;}
74.          else {
75.               qa->coef+=qb->coef;
76.               if(!qa->coef) {qqa->next=qa->next;
77.                              free(qa);
78.                              t=qb;
79.                              qb=qb->next;
80.                              free(t);
81.                             qa=qqa->next;}
82.               else    {qb=qb->next; qqa=qa;qa=qa->next;}
83.                }
84.          }
85.       if(!qa&&qb) qqa->next=qb;
86.      free(Lb);
87. }
89. void SubtractPolyn(polynomial &La,polynomial &Lb)          //减法 
90. {
91.     polynomial qa=La->next,qb=Lb->next,qqa=La,t;
92.       while(qa&&qb)                           
93.         { if(qb->expn>qa->expn) {qqa=qa;qa=qa->next;}
94.           else  if(qb->expn<qa->expn) {
95.               qb->coef=-qb->coef;
96.               qqa->next=qb;
97.               t=qb;
98.               qb=qb->next;
99.               t->next=qa;}
100.          else {
101.               qa->coef-=qb->coef;
102.               if(!qa->coef) {qqa->next=qa->next;
103.                              free(qa);
104.                              t=qb;
105.                              qb=qb->next;
106.                              free(t);
107.                             qa=qqa->next;}
108.               else    {qb=qb->next; qqa=qa;qa=qa->next;}
109.                }
110.          }
111.       if(!qa&&qb) {
112.                   qqa->next=qb;
113.                   while(qb)
114.                      {
115.                      qb->coef=-qb->coef;
116.                      qb=qb->next;        }
117.                      }
118.      free(Lb);}
119.     
120. void CopyPolyn(polynomial &La,polynomial &Lb)         //复制 
121. {
122.      polynomial p,q,pp=La->next;
123.      Lb=(polynomial)malloc(sizeof(Elem));
124.      Lb->expn=-1;
125.      for(;pp;pp=pp->next)
126.        {
127.         p=(polynomial)malloc(sizeof(Elem));
128.         p->coef=pp->coef;
129.         p->expn=pp->expn;
130.         if(pp==La->next) {Lb->next=p;q=p;}
131.         else {q->next=p;q=p;}
132.                       }
133.      p->next=NULL;    }
136. void InsertPolyn(polynomial &La,polynomial &e)        //插入 
137. {
138.      polynomial pa=La,t;
139.      while(pa->next&&pa->next->expn<e->expn)
140.      pa=pa->next;    
141.      if(!pa->next) {pa->next=e;e->next=NULL;}
142.      else if(pa->next->expn>e->expn) {
143.                          e->next=pa->next;
144.                          pa->next=e;
145.                          }
146.      else if(pa->next->expn==e->expn) {
147.                                 pa->next->coef+=e->coef;
148.                                 if(!pa->next->coef) 
149.                                 {
150.                                     t=pa->next;
151.                                     pa->next=pa->next->next;
152.                                    // free(t);
153.                                                  }
154.                                    //free(e); 
155.                                     } 
156.    
157. }
158. void MultiplyPolyn(polynomial La,polynomial Lb,polynomial &Lc) //乘法 
159. {
160.      polynomial qa,qb=Lb,qq;
161.      Lc=(polynomial)malloc(sizeof(Elem));
162.      Lc->expn=-1;
163.      Lc->next=NULL;
164.       while(qb=qb->next)                           
165.       {
166.         for(qa=La->next;qa;qa=qa->next) 
167.              {
168.                qq=(polynomial)malloc(sizeof(Elem));
169.                qq->coef=qa->coef*qb->coef;
170.                qq->expn=qa->expn+qb->expn;
171.                InsertPolyn(Lc,qq);}
172.         }
173. }
175. int main()
176. {
177.     int np,nq;
178.     polynomial p,q,m,r,y;
179.     cin>>np;
180.     CreatPolyn(p,np);
181.     Sort(p,np);
182.     PrintPolyn(p);
183.     
184.     cin>>nq;
185.     CreatPolyn(q,nq);
186.     Sort(q,nq);
187.     PrintPolyn(q);
188.     
189.     CopyPolyn(q,r);
190.     PrintPolyn(r);
191.     
192.     CopyPolyn(q,y);
193.     PrintPolyn(y);
194.      
195.     AddPolyn(p,q);
196.     PrintPolyn(p);
197.     
198.     SubtractPolyn(p,r);
199.     PrintPolyn(p);
200.     
201.     MultiplyPolyn(p,y,m);
202.     PrintPolyn(m);
203.     
204.     return 0;
205.     }
209.           3
210.           2 1
211.           3 0
212.           1 3
213.           3 0
214.           2 1
215.           1 3
217.           
219.           2
220.           1 4
221.           -2 1
222.           -2 1
223.           1 4
227.           -2 1
228.           1 4
232.           -2 1
233.           1 4
237.           3 0
238.           1 3
239.           1 4
243.           3 0
244.           2 1
245.           1 3
249.           -6 1
250.           -4 2
251.           1 4
252.           2 5
253.           1 7
255.           请按任意键继续. . .
258.