zoukankan      html  css  js  c++  java
  • [PAT] 1002 A+B for Polynomials (25 分)Java

    This time, you are supposed to find A+BA+BA+B where AAA and BBB 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:

    KKK N1N_1N1​​aN1a_{N_1}aN1​​​​N2N_2N2​​aN2a_{N_2}aN2​​​​ ... NKN_KNK​​aNKa_{N_K}aNK​​​​

    where KKK is the number of nonzero terms in the polynomial, 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 101K10,0≤NK<⋯<N2<N1≤10000 le N_K < cdots < N_2 < N_1 le 10000NK​​<<N2​​<N1​​1000.

    Output Specification:

    For each test case you should output the sum of AAA and BBB 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.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 }
     
  • 相关阅读:
    Python 描述符(descriptor) 杂记
    Celery 使用简介
    异步任务神器 Celery 简明笔记
    高性能框架gevent和gunicorn在web上的应用及性能测试
    Flask + Gunicorn + Nginx 部署
    Mysql查看最大连接数和修改最大连接数
    配置 influxDB 鉴权及 HTTP API 写数据的方法
    Java 字符串拼接 五种方法的性能比较分析 从执行100次到90万次
    linux端口开放指定端口的两种方法
    java自带的监控工具VisualVM一
  • 原文地址:https://www.cnblogs.com/PureJava/p/10497911.html
Copyright © 2011-2022 走看看