1009. Product of Polynomials (25)[C语言]

最新推荐文章于 2021-10-23 23:45:01 发布

LEAUQEAAN

最新推荐文章于 2021-10-23 23:45:01 发布

阅读量278

点赞数

分类专栏： PAT算法练习文章标签：算法 c语言

本文链接：https://blog.csdn.net/qq_17759721/article/details/71304015

版权

PAT算法练习专栏收录该内容

12 篇文章 0 订阅

订阅专栏

1009. Product of Polynomials (25)

时间限制

400 ms

内存限制

65536 kB

代码长度限制

16000 B

判题程序

Standard

作者

CHEN, Yue

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 a_N1 N2 a_N2 ... NK a_NK, where K is the number of nonzero terms in the polynomial, Ni and a_Ni (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 <stdio.h>
#include <stdlib.h>

int main(){
	int a1[10000],b1[10000],c1[10000];
	double a2[10000],b2[10000],c2[10000];
	int i,j,n,m;
	scanf("%d" ,&n);
	for(i= 0 ; i<n ; i++){
		scanf("%d %lf", &a1[i],&a2[i]);
	} 
	scanf("%d" ,&m);
	int max = -1 ;
	int nm = 0;
	for(i= 0 ; i<m ; i++){
		scanf("%d %lf", &b1[i],&b2[i]);
		for(j =0 ; j < n ; j++){
			c2[b1[i]+a1[j]] += b2[i]*a2[j];
			if(max < b1[i]+a1[j]){
				max = b1[i]+a1[j];
			} 
		}
	} 
	for(i = max; i>=0; i--){
		if(c2[i]!=0 ) nm++;
	}
	printf("%d",nm);
	for(i = max; i>=0; i--){
		if(c2[i] !=0 )printf(" %d %.1f",i,c2[i]);
	}
	return 0 ;
}