C语言编程-7_8 A+B for Polynomials (A、B多项式求和)

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

Input 

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

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

#include<stdio.h>

void main()
{

	int ak, bk, k;
	int a[10] = { 0 }, b[10] = { 0 };
	float aN[10] = { 0 }, bN[10] = { 0 }, n[1001] = {0};

	ak = 0;
	bk = 0;
	k = 0;

	scanf_s("%d", &ak);
	for (int i = 0; i < ak; i++)
	{
		scanf_s(" %d",&a[i]);
		scanf_s(" %f", &aN[i]);
		n[a[i]] += aN[i];         //
	}

	scanf_s("%d", &bk);
	for (int i = 0; i < bk; i++)
	{
		scanf_s(" %d", &b[i]);
		scanf_s(" %f", &bN[i]);
		n[b[i]] += bN[i];
	}
	for (int i = 0; i <=1000; i++) //计算k
	{
		if (n[i] != 0)
		{
			k++;
		}
	}
	printf("%d", k);

	for (int i = 1000; i >= 0; i--) //从指数高的开始输出
	{
		if (n[i] != 0)
		{
			printf(" %d %.1f", i, n[i]);
		}
	}
}