[PAT甲级] 1001 A+B Format (20)

本文介绍了一种简单的算法,用于计算两个整数的和,并将结果以标准格式输出,即使用逗号分隔每三位数字。算法首先读取两个整数a和b,计算它们的和,然后将和转换为字符串,最后遍历字符串并插入逗号以符合格式要求。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

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

一个简单直观的解法如下:

#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
int main()
{
    int a, b;
    cin >> a >> b;
    int sum = a + b;
    char res[9];
    sprintf(res, "%d", sum);
    int cnt = 0, len = strlen(res);
    cnt = len % 3;

    for(int i = 0; i < len; i ++)
    {
        cout << res[i];
        cnt --;
        if (cnt <= 0 && cnt % -3 == 0 && res[i] != '-' && i != len - 1)
        {
            cout << ",";
        }
    }
    return 0;
}

 

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值