PTA数据结构与算法题目集(中文) 7-16

 1 #define _CRT_SECURE_NO_WARNINGS
 2 #include<stdio.h>
 3 
 4 struct PolyNode
 5 {
 6     int Coefficient; //系数
 7     int Exponent;    //指数
 8 }Polynomial[10000],Poly[10000];
 9 int N = 0;
10 int M = 0;
11 void Read()
12 {
13     int Coe, Exp;
14     while (~scanf("%d %d", &Coe, &Exp))
15     {
16         Polynomial[N].Coefficient = Coe;
17         Polynomial[N++].Exponent = Exp;
18     }
19 }
20 void Judge()
21 {
22     for (int i = 0; i < N; i++)
23     {
24         Polynomial[i].Coefficient *= Polynomial[i].Exponent;
25         Polynomial[i].Exponent--;
26         if (Polynomial[i].Coefficient != 0)
27         {
28             Poly[M].Coefficient = Polynomial[i].Coefficient;
29             Poly[M].Exponent = Polynomial[i].Exponent;
30             M++;
31         }
32     }
33 }
34 void Print()
35 {
36     for (int i = 0; i < M - 1; i++)
37         printf("%d %d ", Poly[i].Coefficient, Poly[i].Exponent);
38     printf("%d %d", Poly[M - 1].Coefficient, Poly[M - 1].Exponent);
39     
40 }
41 int main()
42 {
43     Read();
44     Judge();
45     Print();
46     return 0;
47 }