A+B Format（stack的使用）

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 −106≤a,b≤106. 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

题意：

计算两个数的和，并按每三位加一个“，”输出

注意：要从最后一位开始算起，这也是这道题的坑点之一

【分析】

只要明白栈的原理：先进后出，把结果值从最后一位开始入栈，这样出栈的话就可以每三位加一个‘，’输出，但是得注意负数的时候栈中会多出一个负号，得特判一下即可

#include<cstdio>
#include<cstring>
#include<string>
#include<math.h>
#include<iostream>
#include<algorithm>
#include<stack>
#include<cstdlib>
#define eps 1e-9
const double pi = acos(-1.0);
#define ll long long
#define inf 0x3fffffff
const int N = 1010;
using namespace std;

int main()
{
	ll a, b, sum;
	stack<char>ss;
	cin >> a >> b;
	int cnt = 0;
	sum = a + b;

	string str = to_string(sum);//把结果存为字符串

	//cout << "此时结果为：" << str << endl;

	for (int i = str.size()-1; i >=0; i--)//运用栈的原理，
	{
		ss.push(str[i]);
		cnt++;
		
		//cout << "每一次的i的值：" << i << endl;

		if (i == 0)ss.push(str[i]);

		else if (cnt % 3 == 0 && str[i - 1] >= '0'&&str[i - 1] <= '9')
			{
				ss.push(',');
				cnt = 0;
			}
	}
	
	int f = 0;

	while (!ss.empty())
	{
		if (f == 0)ss.pop();//如果是负数的话，会多出一个“-”,所以要去掉第一个负号
		f = 1;
		cout << ss.top();
		ss.pop();
	}
	
	return 0;
}