PAT-1002

来源：互联网发布：新点计价软件编辑：程序博客网时间：2024/05/29 03:51

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.

做这题的时候看错题目了= =。。一直以为最大系数是10来着，于是一直有一个测试点过不去

好蠢= =

所以只需要把系数存在一个double[1001]就好。。

#include <stdio.h>#include <stdlib.h>double polyres[1001];int main() {int k, nk, maxIndex, i, count;double ank;count = 0;maxIndex = 0;scanf("%d", &k);while (k--) {scanf("%d%lf", &nk, &ank);polyres[nk] += ank;if (nk > maxIndex)maxIndex = nk; }scanf("%d", &k);while (k--) {scanf("%d%lf", &nk, &ank);polyres[nk] += ank;if (nk > maxIndex)maxIndex = nk;}for (i = maxIndex; i >= 0; i--)if (polyres[i])count++;printf("%d", count);for (i = maxIndex; i >= 0; i--) {if (polyres[i])printf(" %d %.1lf", i, polyres[i]);}return 0;}

Sample Input

2 1 2.4 0 3.22 2 1.5 1 0.5

Sample Output

3 2 1.5 1 2.9 0 3.2

0 0