添加链接
link管理
链接快照平台
  • 输入网页链接,自动生成快照
  • 标签化管理网页链接
相关文章推荐
忧郁的作业本  ·  Loading...·  4 月前    · 
奋斗的机器人  ·  android - ...·  1 年前    · 

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 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

# include<bits/stdc++.h>
using namespace std;
string int2str(int x)
	stringstream ss;
	ss<<x;
	return ss.str();
int main()
	int a,b,c;
	cin>>a;cin>>b;
	c=a+b;
	int c1=abs(c);
	if(c<0)cout<<"-";
	string s=int2str(c1);
	int cnt=s.size();
	for(int i=0;i<s.size();++i)
		cout<<s[i];
		cnt--;
		if(cnt&&(cnt%3)==0)cout<<",";