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

#include<stdio.h>
#include<math.h>
int main()
{
float a[10],b[10],c[10];
int k,t,i,temp,count=0;
for(i=0;i<10;i++)//赋初值
{
a[i]=0;
b[i]=0;
c[i]=0;
}
scanf("%d",&k);
for(i=0;i<k;i++)
{
scanf("%d",&temp);
scanf("%f",&a[temp]);
}

scanf("%d",&t);
for(i=0;i<t;i++)
{
scanf("%d",&temp);
scanf("%f",&b[temp]);
}
for(i=0;i<10;i++)
{
c[i]=a[i]+b[i];
if(c[i]!=0) count++;
}
if(count==0) count==1;
printf("%d ",count);
for(i=9;i>0;i--)
{
if(c[i]!=0) printf("%d %.1f",i,c[i]);
}
printf("%d %.1f\n",i,c[0]);

return 0;
}