[PAT] 1002 A+B for Polynomials （25 分）Java

最新推荐文章于 2021-10-18 19:23:31 发布

转载最新推荐文章于 2021-10-18 19:23:31 发布 · 196 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

原文链接：http://www.cnblogs.com/PureJava/p/10497911.html

标签

#java

本文介绍了一种解决多项式加法问题的算法实现，输入两个多项式的非零项系数和指数，输出它们的和。算法使用Java实现，通过读取输入文件中的数据，将每个多项式的系数存储在一个数组中，并进行相加操作。最后，输出结果以相同的格式返回。

This time, you are supposed to find

Input Specification:

Each input file contains one test case. Each case occupies 2 lines, and each line contains the information of a polynomial:

$N1N_1N1aN1a_{N_1}aN1N2N_2N2aN2a_{N_2}aN2 ... NKN_KNKaNKa_{N_K}aNK$

where $NiN_iNi and aNia_{N_i}aNi (i=1,2,⋯,Ki=1, 2, \cdots , Ki=1,2,⋯,K) are the exponents and coefficients, respectively. It is given that 1≤K≤101 \le K \le 101≤K≤10，0≤NK<⋯<N2<N1≤10000 \le N_K < \cdots < N_2 < N_1 \le 10000≤NK<⋯<N2<N1≤1000.$

Output Specification:

For each test case you should output the sum of

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

 1  * @Auther: Xingzheng Wang
 2  * @Date: 2019/1/17 12:49
 3  * @Description: PACKAGE_NAME
 4  * @Version: 1.0
 5  */
 6 
 7 import java.util.Scanner;
 8 
 9 public class PAT1002 {
10     public static void main(String[] args) {
11 
12         double[] a = new double[1001];
13         int k = 0;
14 
15         Scanner sc = new Scanner(System.in);
16         k = sc.nextInt();
17         while (k != 0) {
18             int index = sc.nextInt();
19             double n = sc.nextDouble();
20             a[index] += n;
21             k--;
22         }
23 
24         k = sc.nextInt();
25         while (k != 0) {
26             int index = sc.nextInt();
27             double n = sc.nextDouble();
28             a[index] += n;
29             k--;
30         }
31 
32         for (int i = 0; i <= 1000; i++) {
33             if (a[i] != 0) {
34                 k++;
35             }
36         }
37 
38         System.out.print(k);
39         if (k != 0) {
40             System.out.print(" ");
41         }
42         for (int i = 1000; i >= 0; i--) {
43             if (a[i] != 0) {
44                 System.out.printf("%d ", i);
45                 System.out.printf("%.1f", a[i]);
46                 k--;
47                 if (k != 0) {
48                     System.out.print(" ");
49                 }
50             }
51         }
52     }
53 }

转载于:https://www.cnblogs.com/PureJava/p/10497911.html