甲级1002 A+B for Polynomials (25)

题目描述：

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  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=, , ..., K) are the exponents and coefficients, respectively.
It is given that  <= K <= ， <= NK < ... < N2 < N1 <=.

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  decimal place.

Sample Input
  2.4  3.2
  1.5  0.5

Sample Output
  1.5  2.9  3.2

@：
polynomial    多项式
exponents     指数
coefficients  系数

题目要求：

给出俩个多项式的指数和系数，没有给出基数，只要将指数相同的多项式进行系数相加即可。输出时按照指数从高到低的顺序输出。

注意题意，一开始没有看题意直接看的实例，忽略了负数情况相加之后系数可能为零从而不写，所以常用的单词还是得认得。。。

 

代码：

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <iostream>
#include <math.h>

using namespace std;

int main()
{
    int i,j,a,n;
    int con=;
    double s[],b;
    int vis[];
    memset(s,,sizeof(s));
    memset(vis,,sizeof(vis));

    for(i=;i<;i++)
    {
        scanf("%d", &n);
        for(j=;j<n;j++)
        {
            scanf("%d %lf",&a,&b);
            s[a]+=b;
        }
    }

    for(i=;i<=;i++)
        if(s[i]!=)
        con++;

    printf("%d", con);

    for(i=;i>=;i--)
        if(s[i]!=)
            printf(" %d %.1f",i,s[i]);

    printf("\n");

    return ;
}