A1009 Product of Polynomials (25 分)PAT甲级（C）

This time, you are supposed to find A×B where A and B are two polynomials.

Input Specification:

Each input file contains one test case. Each case occupies 2 lines, and each line contains the information of a polynomial:

K N1​ aN1​​ N2​ aN2​​ ... NK​ aNK​​

where K is the number of nonzero terms in the polynomial, Ni​ and aNi​​ (i=1,2,⋯,K) are the exponents and coefficients, respectively. It is given that 1≤K≤10, 0≤NK​<⋯<N2​<N1​≤1000.

Output Specification:

For each test case you should output the product of A and B in one line, with the same format as the input. Notice that there must be NO extra space at the end of each line. Please be accurate up to 1 decimal place.

Sample Input:

2 1 2.4 0 3.2
2 2 1.5 1 0.5

Sample Output:

3 3 3.6 2 6.0 1 1.6

代码如下： 

#include <cstdio>
struct Poly{
	int exp;//指数
	double cof;//系数
}poly[1001];

double ans[2001];//存放结果的系数，【】里的是非零项的指数
int main()
{
	int n, m, number = 0;//分别是第一个多项式，第二个多项式，结果多项式的项数
	//第一个多项式
	scanf("%d", &n);
	for (int i = 0; i < n; i++)
	{
		scanf("%d %lf", &poly[i].exp,&poly[i].cof);
	}
	//第二个多项式
	scanf("%d", &m);
	for (int i = 0; i < m; i++)
	{
		int exp;
		double cof;
		scanf("%d %lf", &exp, &cof);
		//每一项与第一个多项式的每一项相乘
		for (int j = 0; j < n; j++)
		{
			ans[exp + poly[j].exp] += (cof * poly[j].cof);
		}
	}
	for (int i = 0; i <= 2000; i++)
	{
		if (ans[i] != 0.0)number++;
	}
	printf("%d", number);
	for (int i = 2000; i >= 0; i--)
	{
		if (ans[i] != 0.0)
		{
			printf(" %d %.1f", i, ans[i]);
		}
	}
	return 0;
}

最后输出一定要注意！系数的输出格式要为%.lf，即保留一位小数 ，注意是数字1，之前写成了字母l，调了好久。。。