PAT甲级练习1009. Product of Polynomials (25)

1009. Product of 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 Specification:

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 Specification:

For each test case you should output the product 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 up to 1 decimal place.

Sample Input

2 1 2.4 0 3.2
2 2 1.5 1 0.5

Sample Output

3 3 3.6 2 6.0 1 1.6

方法与前面做过的第二题类似，用一个新的数组来保存系数

import java.util.Scanner;

public class Main {
	
	public static void main(String[] args) {		
		
		double[] dCoe1 = new double[1001];
		double[] dCoe2 = new double[1001];
		double[] dCoeOutput = new double[2001];
		int iItemNum;
		int iMaxNum = 0, iCount = 0;
		
		Scanner s = new Scanner(System.in);
		
		iItemNum = s.nextInt();
		for(int j=0; j<iItemNum; j++){
			dCoe1[s.nextInt()] = s.nextDouble();
		}
		iItemNum = s.nextInt();
		for(int j=0; j<iItemNum; j++){
			dCoe2[s.nextInt()] = s.nextDouble();
		}	
		
		for(int i=0; i<1001; i++){
			if(dCoe1[i] != 0){
				for(int j=0; j<1001; j++){
					if(dCoe2[j] != 0){
						dCoeOutput[i+j] += dCoe1[i] * dCoe2[j];
					}
				}
			}	
		}
		
		for(int i=2000;i>=0;i--){  
            if(dCoeOutput[i]!=0){  
                iMaxNum = i;  
                break;  
            }  
        }  
          
        for(int i=iMaxNum;i>=0;i--){  
            if(dCoeOutput[i]!=0){  
                iCount++;  
            }  
        }  
          
        System.out.printf("%d", iCount);  
        for(int i=2000;i>=0;i--){  
            if(dCoeOutput[i]!=0){  
                System.out.printf(" %d %.1f", i, dCoeOutput[i]);  
            }  
        }  
		
	}
}