1001 A+B Format (20 point(s))

最新推荐文章于 2024-09-25 10:36:42 发布

utopianist

最新推荐文章于 2024-09-25 10:36:42 发布

阅读量89

点赞数

分类专栏： PAT 文章标签：算法 leetcode PAT c++

本文链接：https://blog.csdn.net/qq_35193302/article/details/117015599

版权

PAT 专栏收录该内容

6 篇文章 1 订阅

订阅专栏

1001 A+B Format (20 point(s))

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<iostream>
#include<vector>

using namespace std;

int main(){
    
    int n,m=0;
    cin>>n>>m;
    int sum = n + m;
    if(sum == 0){
        cout<<0;
        return 0;
    }
    if(sum < 0){
        cout<< "-";
        sum *= -1;
    }
    vector<int> v;
    while(sum != 0){  // 要输出逗号，肯定要自己处理输出了
        v.push_back(sum%10);
        sum /= 10;
    }
    for(int i= v.size() - 1;i >= 0;i--){
        cout<< v[i];
        if(i>0&&i%3 == 0) cout<<',';  // i>0 才 ac 的，你能想得到？？？
        // 界限思维，非常重要啊。

    }
    
    
    return 0;
}