1002 A B for 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 N​1​​ a​N​1​​​​ N​2​​ a​N​2​​​​ ... N​K​​ a​N​K​​​​

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

Output Specification:

For each test case you should output the sum 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 to 1 decimal place.

Sample Input:

2 1 2.4 0 3.2
2 2 1.5 1 0.5

Sample Output:

3 2 1.5 1 2.9 0 3.2


int main()
	double a1[1000]={0},a2[1000]={0};
	int i,count=0;
	int k1,k2;
	while(k1--) {					//读入第一行多项式 
		scanf("%d",&i);		//次数为i,系数 是a1[i] 不能一句话读入,因为i在两句都出现了 
	scanf("%d",&k2);			//读入第二行多项式 
	while(k2--) {
		scanf("%d",&i);		//次数为i,系数 是a2[i] 
		if(a1[i]==0) a1[i]=a2[i];	//如果i次项 在第一行不存在,加入i次项 
		else a1[i]+=a2[i];			//如果两行都有i次项,加和 
	for(i=0; i<1000; i++) {
		if(a1[i] != 0) count++;
	for(i=1000; i>=0; i--)	{		//输出 
		if(a1[i] != 0) {					//如果系数不为零 
			printf(" %d %.1f",i,a1[i]);
	return 0;


已标记关键词 清除标记
©️2020 CSDN 皮肤主题: 大白 设计师:CSDN官方博客 返回首页