1002. A+B for Polynomials (25)
This time, you are supposed to find A+B where A and B are two polynomials.
Input
Each input file contains one test case. Each case occupies 2 lines, and each line contains the information of a polynomial: K N1 aN1 N2 aN2 ... NK aNK, where K is the number of nonzero terms in the polynomial, Ni and aNi (i=1, 2, ..., K) are the exponents and coefficients, respectively. It is given that 1 <= K <= 10,0 <= NK < ... < N2 < N1 <=1000.
Output
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.
Sample Input2 1 2.4 0 3.2 2 2 1.5 1 0.5Sample Output
3 2 1.5 1 2.9 0 3.2
分析:
这道题目其实还没有许多乙级的题目难。技巧在于,由于N的值不会超过1000,所以可以用一个Int[1001]来表示所有次数的项的值,输入时把值存到相应位置,并在相应位置加减就可以了。
还要注意的是,统计项数的时候一定要去除非0项,我是用的msg字符串来表示输出,这样可以一次遍历就找到K和所有输出。
using System; using System.Text; namespace PAT { class Program { static void Main() { double[] numberFlags = new double[1001]; int flagCount = 0; for (int i = 0; i < 2; i++) { string[] infos = Console.ReadLine().Split(' '); int length1 = int.Parse(infos[0]); int index; double number; for (int j = 1; j < infos.Length - 1; j = j + 2) { index = int.Parse(infos[j]); number = double.Parse(infos[j + 1]); numberFlags[index] += number; } } StringBuilder msg = new StringBuilder(); for(int i = 1000; i >= 0; i--) { if (numberFlags[i] != 0) { msg.AppendFormat(" {0} {1:F1}", i, numberFlags[i]); flagCount++; } } Console.Write(flagCount + msg.ToString()); } } }