PAT_甲级1009

自己先写了一遍1009题，忘记了1002题中用int型整数作数组下标的解法，写了个稀烂的代码，输出结果相符，但无法通过测试。权作记录：

#include <iostream>
using namespace std;
int A_exponent[10], B_exponent[10], C_exponent[100];//定义指数数组。
float A_coefficient[10], B_coefficient[10], C_coefficient[100];//定义系数数组。

int main()
{//此处不用两个for循环进行嵌套，可以更好区分A和B实例。
		int num_A,num_B;
		scanf_s("%d", &num_A);
		for (int i = 0; i < num_A; i++)//录入A实例
		{
			scanf_s("%d",&A_exponent[i]);
			scanf_s("%f",&A_coefficient[i]);
		}
		scanf_s("%d", &num_B);
		for (int i = 0; i < num_B; i++)//录入B实例
		{
			scanf_s("%d",&B_exponent[i]);
			scanf_s("%f",&B_coefficient[i]);
		}
		int m = 0;
		for (int j = 0; j < num_A; j++)//多项式相乘计算
		{
			for (int k = 0; k < num_B; k++)
			{
					C_exponent[m] = A_exponent[j] + B_exponent[k];
					C_coefficient[m] = A_coefficient[j] * B_coefficient[k];
					m = m + 1;
			}
		}
		int num_C = m / 2 + 1;
		for (int i = 0; i < m; i++)
		{
			for (int g = i + 1; g < m; g++)
			{
				if (C_exponent[i] == C_exponent[g]&& C_exponent[g]!=0)//当指数相等时，将系数相加
				{
					C_coefficient[i] = C_coefficient[i] + C_coefficient[g];
					C_exponent[g] = 0;
				}
			}			
		}
		printf("%d",num_C);
		for (int i = 0; i <= num_C; i++)
		{
			if (C_exponent[i]!=0)
			{
				printf(" %d %.1f", C_exponent[i], C_coefficient[i]);
			}
		}
}

再贴一篇柳神的代码，简洁高效1009. Product of Polynomials (25)-PAT甲级真题

#include <iostream>
using namespace std;
int main() {
    int n1, n2, a, cnt = 0;
    scanf("%d", &n1);
    double b, arr[1001] = {0.0}, ans[2001] = {0.0};
    for(int i = 0; i < n1; i++) {
        scanf("%d %lf", &a, &b);
        arr[a] = b;
    }
    scanf("%d", &n2);
    for(int i = 0; i < n2; i++) {
        scanf("%d %lf", &a, &b);
        for(int j = 0; j < 1001; j++)
                ans[j + a] += arr[j] * b;
    }
    for(int i = 2000; i >= 0; i--)
        if(ans[i] != 0.0) cnt++;
    printf("%d", cnt);
    for(int i = 2000; i >= 0; i--)
        if(ans[i] != 0.0)
            printf(" %d %.1f", i, ans[i]);
    return 0;
}