PAT (Advanced Level) Practice 1001

本文介绍了一个简单的字符串处理算法,用于计算两个整数的和,并将结果显示为标准格式,即每三位数字用逗号分隔。输入包括两个整数a和b,输出为它们的和,格式化为标准形式。

1001 A+B Format (20 分)

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

Each input file contains one test case. Each case contains a pair of integers a and b where −10​6​​≤a,b≤10​6​​. The numbers are separated by a space.

Output Specification:

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

 分析:简单的字符串处理,注意输出为0的情况

 代码:

#include<iostream>
#include<cmath>
#include<string>
using namespace std;
int main() {
	string A, B;
	cin >> A >> B;
	int a = atoi(A.c_str());
	int b = atoi(B.c_str());
	int c = a + b;
	string C = "";
	int index = 0;
	int temp = abs(c);
	while (temp != 0) {
		if (index == 3) {
			C = ',' + C;
			index = 0;
		}
		index++;
		C = (char)(temp % 10 + '0') + C;
		temp /= 10;
	}
	if (c < 0) {
		C = '-' + C;
	}
	if (C.size() > 0) {
		cout << C << endl;
	}else {
		cout << '0' << endl;
	}
	return 0;
}

 

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值