一元多项式的加法

#define _CRT_SECURE_NO_WARNINGS
#include
#include
using namespace std;


struct Per 
{
    int a; 
    int n; 
};

vector<Per> Read() 
{
    int num;
    cin >> num;
    vector<Per> v(num);
    for (int i = 0; i < num; i++) 
    {
        cin >> v[i].a >> v[i].n;
    }
    return v;
}

vector<Per> ADD(vector<Per>& v1, vector<Per>& v2)
{
    vector<Per> s;
    int i = 0, j = 0;
    
    while (i < v1.size() && j < v2.size()) 
    {
         if (v1[i].n > v2[j].n) 
        {
            s.push_back(v1[i]);
            i++;
        }
        else if (v1[i].n < v2[j].n)
        {
            s.push_back(v2[j]);
            j++;
        }
        else if (v1[i].n == v2[j].n)
        {
            int a = v1[i].a + v2[j].a;
            int n = v1[i].n;

            if (a != 0)
            {
                s.push_back({ a, n });
                
            }
            
            i++;
            j++;
        }
    }
    while (i < v1.size()) 
    {
        s.push_back(v1[i]);
        i++;
    }
    while (j < v2.size()) 
    {
        s.push_back(v2[j]);
        j++;
    }
 
    
    return s;
}

void Print(vector<Per>& v) 
{
    int flag = 1;
    for (int i = 0; i < v.size(); i++) 
    {
        if(v[i].a !=0)
        {
            cout << v[i].a << " " << v[i].n;
            flag = 0;
        }
        if (i != v.size() - 1) 
        {
            cout << " ";
        }
    }
     if (flag)
     printf("0 0");
}

int main() 
{
    vector<Per> Vx = Read();
    vector<Per> Vy = Read();

    vector<Per> sum = ADD(Vx, Vy);

    Print(sum);

    return 0;
}


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