-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathdata 5.cpp
More file actions
106 lines (96 loc) · 2.04 KB
/
data 5.cpp
File metadata and controls
106 lines (96 loc) · 2.04 KB
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
#include <stdio.h>
#include <stdlib.h>
typedef int ElemType;
typedef struct polynomial {
ElemType data;
ElemType index;
struct polynomial *next;
};
polynomial *tmp;
void CreatePolyn(polynomial &P, int m);
void AddPolyn(polynomial &Pa, polynomial Pb);
void PrintPolyn(polynomial P);
int main(void) {
int n;
polynomial *HEAD1, *HEAD2, *HEAD3;
scanf("%d", &n);
if (n == 0) return 0;
HEAD1 = (polynomial*)malloc(sizeof(polynomial));
HEAD1->next = NULL;
scanf("%d", &n);
CreatePolyn(*HEAD1, n);
HEAD2 = (polynomial*)malloc(sizeof(polynomial));
HEAD2->next = NULL;
scanf("%d", &n);
CreatePolyn(*HEAD2, n);
HEAD3 = (polynomial*)malloc(sizeof(polynomial));
HEAD3->next = NULL;
scanf("%d", &n);
CreatePolyn(*HEAD3, n);
PrintPolyn(*HEAD1);
PrintPolyn(*HEAD2);
PrintPolyn(*HEAD3);
AddPolyn(*HEAD1, *HEAD2);
PrintPolyn(*HEAD1);
AddPolyn(*HEAD1, *HEAD3);
PrintPolyn(*HEAD1);
}
void CreatePolyn(polynomial &P, int m) {
polynomial *p = &P;
while (m--) {
int tmp1, tmp2;
scanf("%d", &tmp1);
scanf("%d", &tmp2);
tmp = (polynomial*)malloc(sizeof(polynomial));
tmp->data = tmp1;
tmp->index = tmp2;
p->next = tmp;
p = p->next;
p->next = NULL;
}
}
void AddPolyn(polynomial &Pa, polynomial Pb) {
polynomial *a = &Pa;
polynomial *b = &Pb;
polynomial *pa = a->next;
polynomial *pb = b->next;
while (pa && pb) {
if (pa->index < pb->index) {
a = pa;
pa = pa->next;
}
else if (pa->index == pb->index) {
pa->data += pb->data;
if (pa->data == 0) {
a->next = pa->next;
pa->next = NULL;
free(pa);
}
b->next = pb->next;
free(pb);
pa = a->next;
pb = b->next;
}
else if (pa->index > pb->index) {
b->next = pb->next;
pb->next = pa;
a->next = pb;
pb = b->next;
}
}
if (pb != NULL) {
if (a->next != NULL) {
pa->next = pb;
}
else a->next = pb;
}
}
void PrintPolyn(polynomial P) {
polynomial *p = &P;
if(p->next==NULL) printf("<0,0>\n");
while (p->next != NULL) {
p = p->next;
if(p->next!=NULL) printf("<%d,%d>,", p->data, p->index);
else printf("<%d,%d>\n", p->data, p->index);
}
}