关闭

1009. Product of Polynomials (25)

标签: PAT
122人阅读 评论(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 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 <iostream>
#include<cstdio>
#include<string.h>
#include<algorithm>
#include<cmath>
using namespace std;
int main()
{
	int m,n;
	int x;
	int cnt=0;
	double a[1005],b[1005],c[2010]={0};///a,b,c保存到都是该指数对应的系数 
	cin>>m;
	for(int i=0;i<m;i++)
	{
		cin>>x;
		cin>>a[x];
	}
	cin>>n;
	for(int i=0;i<n;i++)
	{
		cin>>x;
		cin>>b[x];
	}
	for(int i=0;i<1001;i++)
	{
		for(int j=0;j<1001;j++)
		{
			c[i+j]+=a[i]*b[j];
		}
	}
	for(int i=0;i<2010;i++)
	{
		if(c[i]!=0)
			cnt++;	
	}
	cout<<cnt;
	for(int i=2002;i>=0;i--)
	{
		if(c[i]!=0)
		printf(" %d %.1lf",i,c[i]); 
	}
	return 0;
}
注意,其实PAT跟蓝桥杯是差不多的,暴力循环枚举即可

0
0

查看评论
* 以上用户言论只代表其个人观点,不代表CSDN网站的观点或立场
    个人资料
    • 访问:145642次
    • 积分:6171
    • 等级:
    • 排名:第4011名
    • 原创:483篇
    • 转载:0篇
    • 译文:0篇
    • 评论:78条
    最新评论