首页 > 试题广场 >

A+B for Polynomials (25)

[编程题]A+B for Polynomials (25)
  • 热度指数:5339 时间限制:C/C++ 1秒,其他语言2秒 空间限制:C/C++ 32M,其他语言64M
  • 算法知识视频讲解
This time, you are supposed to find A+B where A and B are two polynomials.

输入描述:
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.


输出描述:
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.
示例1

输入

2 1 2.4 0 3.2<br/>2 2 1.5 1 0.5

输出

3 2 1.5 1 2.9 0 3.2
a,b = input().split(),input().split()
d = {}
for i in range(1,len(a),2):
    c = eval(a[i])
    d[c] = d[c] + eval(a[i + 1]) if c in d else eval(a[i + 1])
for i in range(1,len(b),2):
    c = eval(b[i])
    d[c] = d[c] + eval(b[i + 1]) if c in d else eval(b[i + 1])

e = [str(len(d))]
for i in sorted(d,reverse = True):
    if d[i]:
        e.append(str(i) + ' ' + '{:.1f}'.format(d[i]))
    else:
        e[0] = str(int(e[0]) - 1)
print(' '.join(e))

发表于 2020-02-07 14:03:16 回复(0)

问题信息

难度:
2条回答 7330浏览

热门推荐

通过挑战的用户

A+B for Polynomials (25)