含泪补基础
A1001 A+B Format (字符串处理,附详细注释)
1. 题目描述
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.
2. 解题思路
- 时间空间复杂度都在范围内,不需要考虑
- 数的范围可以用int表示
- 注意字符串的处理
这里每3位需要输出一个“,”,通过i+1与len的对3取余,并且不是最后一个数,判断是否加逗号。这里我举两个例子:
例一:需要输出1,123,123
例二:需要输出-123,123
3. 参考代码
/*
1001
A+B Format
*/
#include <iostream>
#include <string>
using namespace std;
int main()
{
int a, b;
cin >> a >> b;
int sum;
sum = a+b;
// printf("%d\n",sum);
string s = to_string(sum);
int len = s.length();
for(int i=0; i<len; i++){
cout<<s[i];
if(s[i] == '-') continue;
// 注意这里,每3位输出一个逗号,通过i+1与len的对3取余,判断是否加逗号
if((i+1)%3 == len%3 && (i+1 != len)){
cout<< ",";
}
}
return 0;
}
以上就是对于本题的解题思路了,如果你觉得我的文章对你有用请点个赞支持一下吧。如果此文章有错误或者有不同的见解欢迎评论或者私信。wink~