PAT甲级练习1002. A+B for Polynomials (25)

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.22 2 1.5 1 0.5

Sample Output

3 2 1.5 1 2.9 0 3.2

基本思路是建立一个数组，其中位置可以表示指数值，对应的值即为系数

import java.util.Scanner;public class Main {public static void main(String[] args) {double[] n = new double[1001];int maxnum = 0;int count = 0;Scanner s = new Scanner(System.in);for(int i=0;i<2;i++){int itemnum = s.nextInt();for(int j=0;j<itemnum;j++){n[s.nextInt()] += s.nextFloat();}}for(int i=1000;i>=0;i--){if(n[i]!=0){maxnum = i;break;}}for(int i=maxnum;i>=0;i--){if(n[i]!=0){count++;}}System.out.printf("%d", count);for(int i=1000;i>=0;i--){if(n[i]!=0){System.out.printf(" %d %.1f", i, n[i]);}}}}

中间遇到的一个问题是，原先数组是float型的，提交时总是随机出现 返回非零 的错误，后来将其改为double类型后，一次提交即过，但并不完全确定是否是因为这个。