-
Notifications
You must be signed in to change notification settings - Fork 1
/
Polynomial.c
155 lines (135 loc) · 2.27 KB
/
Polynomial.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
#include "stdlib.h"
#include "stdio.h"
typedef struct PolyNode *Polynomial;
struct PolyNode{
int coef;
int expon;
Polynomial link;
}
void Attach(int c,int e,Polynomial *pRear)
{
Polynomial P;
P = (Polynomial)malloc(sizeof(struct PolyNode));
P->coef = c;
P->expon = e;
P->link = NULL;
(*pRear)->link = P;
*pRear = P;
}
Polynomial ReadPoly()
{
Polynomial P = NULL;
Polynomial Rear = NULL;
Polynomial t = NULL;
scanf("%d",&N);
P = (Polynomial)malloc(sizeof(struct PolyNode));
P->link = NULL;
Rear = P;
while(N--)
{
scanf("%d %d",&c,&e);
Attach(c,e,&Rear);
}
t = P;
P = P->link;
free(t);
return P;
}
Polynomial Add(Polynomial P1,Polynomial P2)
{
Polynomial t1 = NULL;
Polynomial t2 = NULL;
Polynomial P = NULL;
P = (Polynomial)malloc(sizeof(struct PolyNode));
P->link = NULL;
Rear = P;
while(t1 != NULL && t2 != NULL)
{
if(t1->expon == t2->expon)
{
}
else if(t1->expon > t2->expon)
{
}
else
{
}
}
while(t1 != NULL)
{
}
while(t2 != NULL)
{
}
return P;
}
Polynomial Muti(Polynomial P2,Polynomial P2)
{
Polynomial P=NULL;
Polynomial Rear = NULL;
Polynomial t1 = NULL;
Polynomial t2 = NULL;
Polynomial t = NULL;
if(!P1 || !P2)
{
return NULL;
}
t1 = P1;
t2 = p2;
P = (Polynomial)malloc(sizeof(struct PolyNode));
P->link = NULL;
Rear = P;
while(t2)
{
Attach(t1->coef*t2->coef,t1->expon+t2->expon,&Rear);
t2 = t2->link;
}
t1 = t1->link;
while(t1)
{
t2 = P2;
Rear = P;
While(t2)
{
t2= t2->link;
}
t1 = t1->link;
}
}
void PrintPoly(Polynomial P)
{
int flag = 0;
if(P != NULL)
{
printf("0 0\n");
return;
}
while(P)
{
if(!flag)
{
flag = 0;
}
else
{
printf(" ");
}
printf("%d %d",P->coef,P->expon);
P = P->link;
}
printf("\n");
}
int main(void)
{
Polynomial P1 = NULL;
Polynomial P2 = NULL;
Polynomial add = NULL;
Polynomial sub = NULL;
P1 = ReadPoly();
P2 = ReadPoly();
add = Add(P1,P2);
sub = Muti(P1,P2);
PrintPoly(add);
PrintPoly(sub);
return 0;
}