A1009

题目

A1009 Product of Polynomials (25 分)
题目内容
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… NKaNK
where K is the number of nonzero terms in the polynomial, Niand 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[poly[j].exp+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;
}

总结

1.运用结构体
2.注释