1002. A+B for 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
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
PAT上写了道题，codeblocks上运行正常，为什么提交总是格式错误啊。郁闷啊，还未解决。代码如下：
#include
#include
int main()
{
float a[1001];
int i=0,len=0;
for(;i
a[i]=0;
int n=2;
while(n!=0)
{
scanf("%d",&len);
for(i=1;i
{
int k; float co;
scanf("%d",&k);
scanf("%f",&co);
a[k]+=co;
}
n--;
}
len=0;
for(i=0;i
if(a[i]!=0)
len++;
printf("%d ",len);
for(i=1000;i>=0;i--)
if(a[i]!=0)
{
printf("%d ",i);
printf("%.1f",a[i]);
if(len)
printf(" ");
len--;
}
return 0;
}
