# 【PAT A1001】1001 A+B Format (20)（20 分）

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.

Calculate a + b and output the sum in standard format -- that is, the digits must be separated into groups of three by commas (unless there are less than four digits).

Input

Each input file contains one test case. Each case contains a pair of integers a and b where -1000000 <= a, b <= 1000000. The numbers are separated by a space.

Output

For each test case, you should output the sum of a and b in one line. The sum must be written in the standard format.

Sample Input

`-1000000 9`
Sample Output

`-999,991`
code：

``````#include <string>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
char s[100];
itoa(a + b,s,10);
int len = s.length();
for (int i = 0; i < len; i++) {
cout << s[i];
if (s[i] == '-') continue;
if ((i + 1) % 3 == len % 3 && i != len - 1) cout << ",";
}
return 0;
}`````````

### 推荐阅读更多精彩内容

• rljs by sennchi Timeline of History Part One The Cognitiv...
sennchi阅读 6,313评论 0 10
• 简悦直播教练恬源阅读 84评论 0 2
• DOM0 事件和DOM2级在事件监听使用方式上有什么区别？ DOM0:Element节点对象有事件属性，可以指定监...
饥人谷_全阅读 129评论 0 0
• 日常的居家生活里，免不了女主人的针线活，从最初拙劣的针法到后来完美的挑脚，一针一线之间显现出女主人的心灵手巧。 彼...
一缕清风袭来阅读 289评论 0 3