练习44

 

1. /*****************************************************************************************
3.   44. (一元多项式加法) 实现两个整系数一元多项式的加法。例如, 对于多项式
4.  5*X^6＋4*X^3－7*X^4＋1 与多项式 50*X^2＋4*X, 运算结果为：
5.  5*X^6－7*X^4＋4*X^3＋50*X^2＋4*X＋1。
7.    程序要求：键盘输入多项式的各项系数及指数，每项系数及指数为一组数据（系
8.  数及指数之一可为零），以'0,0'结束一个多项式的输入，结果按降幂排列，同类
9.  项要合并（指数最大不超过３０）。
11.    上例第一式的输入为：    5,6
12.                            4,3
13.                           -7,4
14.                            1,0
15.                            0,0
16.   输出结果应为：5*x^6-7*x^4+4*x^3+50*x^2+4*x+1.
18.   *****************************************************************************************/
20. #include <stdio.h>
21. #include <malloc.h>
23. typedef struct tagNode
24. {
25.     int c;
26.     int p;
27.     tagNode *next;
28. } Node;
30. FILE *fp;
32. void sort(Node *l)
33. {
34.     Node *cur,*max,*pos;
35.     for(pos=l; pos; pos=pos->next)
36.     {
37.         max = pos;
38.         for(cur=pos->next; cur; cur=cur->next)
39.         {
40.             if(cur->p > max->p)
41.                 max = cur;
42.         }
43.         if(max != pos)
44.         {
45.             int c,p;
46.             c = max->c;
47.             p = max->p;
48.             max->c = pos->c;
49.             max->p = pos->p;
50.             pos->c = c;
51.             pos->p = p;
52.         }
53.     }
54. }
56. Node* CreateLink()
57. {
58.     int c,p;
59.     Node *head = NULL;
60.     Node *tail = NULL;
61.     Node *temp = NULL;
63.     
64.     while(1)
65.     {
66.         fscanf(fp,"%d",&c);
67.         fscanf(fp,"%c",&p);
68.         fscanf(fp,"%d",&p);
70.         if(c==0 && p==0)
71.             break;
73.         temp = (Node*)malloc(sizeof(Node));
74.         temp->c = c;
75.         temp->p = p;
76.         temp->next = NULL;
77.         if(!head)
78.         {
79.             tail = head = temp;
80.         }
81.         else 
82.         {
83.             tail->next = temp;
84.             tail = tail->next;
85.         }
86.     }
88.     return head;
89. }
91. Node* AddLink(Node *la, Node *lb)
92. {
93.     Node *head=NULL,*tail=NULL,*temp;
94.     Node *s,*t;
95.     s = la;
96.     t = lb;
98.     while(s && t)
99.     {
100.         temp = (Node*)malloc(sizeof(Node));
101.         temp->next = NULL;
102.         if(s->p == t->p)
103.         {
104.             temp->c = s->c + t->c;
105.             temp->p = s->p;
106.             s = s->next;
107.             t = t->next;
108.         }
109.         else if(s->p > t->p)
110.         {
111.             temp->c = s->c;
112.             temp->p = s->p;
113.             s = s->next;
114.         }
115.         else 
116.         {
117.             temp->c = t->c;
118.             temp->p = t->p;
119.             t = t->next;
120.         }
121.         if(!head)
122.         {
123.             head = tail = temp;
124.         }
125.         else 
126.         {
127.             tail->next = temp;
128.             tail = tail->next;
129.         }
130.     }
131.     if(!t)
132.         s = t;
133.     while(s)
134.     {
135.         temp = (Node*)malloc(sizeof(Node));
136.         temp->c = s->c;
137.         temp->p = s->p;
138.         s = s->next;
139.         if(!head)
140.         {
141.             head = tail = temp;
142.         }
143.         else 
144.         {
145.             tail->next = temp;
146.             tail = tail->next;
147.         }
148.     }
150.     return head;
151. }
153. void PrintLink(Node* l)
154. {
155.     Node* cur = l;
156.     while(cur)
157.     {
158.         if(cur->c > 0 && cur != l)
159.             printf("+"); 
160.         if(cur->p != 0)
161.         {
162.             if(cur->p != 1)
163.             {
164.                 if(cur->c != 1)
165.                 {
166.                     if(cur->c != -1)
167.                         printf("%dX^%d",cur->c,cur->p);
168.                     else printf("-X^%d",cur->p);
169.                 }
170.                 else
171.                     printf("X^%d",cur->p);
172.             }
173.             else
174.             {
175.                 if(cur->c != 1)
176.                 {
177.                     if(cur->c != -1)
178.                         printf("%dX",cur->c);
179.                     else printf("-X");
180.                 }
181.                 else
182.                     printf("X");
183.             }
184.         }
185.         else printf("%d",cur->c);
186.         cur = cur->next;
187.     }
188.     printf("/n");
189. }
191. void main()
192. {
193.     Node *la,*lb,*lc;
195.     fp = fopen("data.txt","r");
196.     if(!fp) return; 
198.     la = CreateLink();
199.     sort(la);
200.     PrintLink(la);
201.     lb = CreateLink();
202.     sort(lb);
203.     PrintLink(lb);
204.     lc = AddLink(la,lb);
205.     sort(lc);
206.     PrintLink(lc);
208.     fclose(fp);
209. }