1002 A+B for Polynomials (25分)
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 …
每個輸入文件包含一個測試用例。 每個案例佔用2行,並且每行包含一個多項式的信息:
K …
where K is the number of nonzero terms in the polynomial, and(i=1,2,⋯,K) are the exponents and coefficients, respectively. It is given that 1≤K≤10,0≤<⋯<<≤1000.
其中K是多項式中非零項的數量,and(i=1,2,⋯,K) 分別是指數和係數。 假設1≤K≤10,0≤<⋯<<≤1000.
Output Specification:
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.
對於每個測試用例,應在一行中輸出A和B的總和,格式與輸入相同。 請注意,每行末尾不得有多餘的空間。 請精確到小數點後一位。
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
要點
-
最難理解的是題目
-
請注意,每行末尾不得有多餘的空間。
-
請精確到小數點後一位。
System.out.printf("%.1f", C[i]);
代碼
import java.util.Arrays;
import java.util.Scanner;
public class PolynomialAddition1 {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
Double[] A = new Double[1001];
for (int i = 0; i < 1001; i++) { //防止 C[i] = A[i] + B[i];發生空指針異常
A[i] = 0.0;
}
Double[] B = new Double[1001];
for (int i = 0; i < 1001; i++) {//防止 C[i] = A[i] + B[i];發生空指針異常
B[i] = 0.0;
}
int K = sc.nextInt();
int index;
while (K != 0) {
index = sc.nextInt(); //指數
A[index] = sc.nextDouble(); //係數
K--;
}
// System.out.println(Arrays.toString(A));
K = sc.nextInt();
while (K != 0) {
index = sc.nextInt(); //指數
B[index] = sc.nextDouble(); //係數
K--;
}
sc.close();
// System.out.println(Arrays.toString(B));
double[] C = new double[1001];
int count = 0;
for (int i = 0; i < 1001; i++) {
if (A[i] != 0 || B[i] != 0) {
count++;
C[i] = A[i] + B[i];
}
}
// System.out.println(Arrays.toString(C));
System.out.print(count);
for (int i = 1000; i >= 0; i--) {
if (C[i] != 0) {
System.out.print(" " + i + " ");
System.out.printf("%.1f", C[i]);
}
}
}
}