PAT A1002. A+B for Polynomials

最新推荐文章于 2015-03-29 20:55:33 发布

水木行者

最新推荐文章于 2015-03-29 20:55:33 发布

阅读量393

点赞数

分类专栏： PAT

本文链接：https://blog.csdn.net/youm11/article/details/44131307

版权

PAT 专栏收录该内容

35 篇文章 0 订阅

订阅专栏

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 a_N1 N2 a_N2 ... NK a_NK, where K is the number of nonzero terms in the polynomial, Ni and a_Ni (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 #include <stdio.h>

int main() {
double num[1001] = {
0.0
};
int K1, K2, m, i, count;
double n;
scanf("%d", &K1);
for(i = 0; i < K1; i ++) {
scanf("%d", &m);
scanf("%lf", &n);
num[m] += n;
}
scanf("%d", &K2);
for(i = 0; i < K2; i ++) {
scanf("%d", &m);
scanf("%lf", &n);
num[m] += n;
}
for(i = 1000, count = 0; i >= 0; i --) {
if(num[i] != 0) {
count ++;
}
}
if(count == 0) {
printf("0");
} else {
printf("%d ", count);
}
for(i = 1000; i >= 0; i --) {
if(num[i] != 0) {
printf("%d %.1f", i, num[i]);
count --;
if(count != 0) {
printf(" ");
}
}
}
return 0;
}3.2