【JAVA】1002 A+B for Polynomials (25分) PAT甲级 PAT (Advanced Level) Practice
内容导读
互联网集市收集整理的这篇技术教程文章主要介绍了【JAVA】1002 A+B for Polynomials (25分) PAT甲级 PAT (Advanced Level) Practice,小编现在分享给大家,供广大互联网技能从业者学习和参考。文章包含2392字,纯文字阅读大概需要4分钟。
内容图文
![【JAVA】1002 A+B for Polynomials (25分) PAT甲级 PAT (Advanced Level) Practice](/upload/InfoBanner/zyjiaocheng/634/0ab4b58d975d4af2bfd80e6db9dbbdff.jpg)
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 N1? aN?1 N2? aN?2… NK? aN?K
每个输入文件包含一个测试用例。 每个案例占用2行,并且每行包含一个多项式的信息:
K N1? aN?1 N2? aN?2… NK? aN?K
where K is the number of nonzero terms in the polynomial, Ni?andaN?i(i=1,2,?,K) are the exponents and coefficients, respectively. It is given that 1≤K≤10,0≤NK??<?<N2?<N1?≤1000.
其中K是多项式中非零项的数量,Ni?andaN?i(i=1,2,?,K) 分别是指数和系数。 假设1≤K≤10,0≤NK??<?<N2?<N1?≤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]);
}
}
}
}
内容总结
以上是互联网集市为您收集整理的【JAVA】1002 A+B for Polynomials (25分) PAT甲级 PAT (Advanced Level) Practice全部内容,希望文章能够帮你解决【JAVA】1002 A+B for Polynomials (25分) PAT甲级 PAT (Advanced Level) Practice所遇到的程序开发问题。 如果觉得互联网集市技术教程内容还不错,欢迎将互联网集市网站推荐给程序员好友。
内容备注
版权声明:本文内容由互联网用户自发贡献,该文观点与技术仅代表作者本人。本站仅提供信息存储空间服务,不拥有所有权,不承担相关法律责任。如发现本站有涉嫌侵权/违法违规的内容, 请发送邮件至 gblab@vip.qq.com 举报,一经查实,本站将立刻删除。
内容手机端
扫描二维码推送至手机访问。