zoukankan      html  css  js  c++  java
  • 1001. A+B Format (20)

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

    分析:首先将和按3位分开,自然想到了对1000取余的办法。于是按照二进制的除二取余的思路将和分开。需要注意的是,对1000取余后得到的结果可能不是三位数,而是两位或者一位,这个时候就需要在输出的时候在前面补零凑够三位。这里用到了栈。

    #include <iostream>
    #include <cstdio>
    #include <cmath>
    #include <cstring>
    #include <algorithm>
    #include <vector>
    #include <stack>
    using namespace std;
    
    int main()
    {
        long a,b,c;
        cin>>a>>b;
        c=a+b;
        if(c==0)
        {
            cout<<0<<endl;
            return 0;
        }
        int flag=1;
        if(c<0)
        {
            c*=-1;
            flag=-1;
        }
        stack<long> ans;
        while(c>0)
        {
            ans.push(c%1000);
            c/=1000;
        }
        if(flag==-1)
        {
            printf("-");
        }
        //输出第一个数
        printf("%ld", ans.top());
        ans.pop();
        while(ans.size()>0)
        {
            printf(",%03ld",ans.top());
            ans.pop();
        }
        cout<<endl;
        return 0;
    }
  • 相关阅读:
    nodeJS 菜鸟入门
    Chrome 鲜为人知的秘籍(内部协议)&&Chrome功能指令大全
    前端工作面试问题
    ECharts模块化使用5分钟上手
    AppCan 之初体验
    Phonegap 环境配置
    【位运算】判断一个数是否为2的n次方
    【位运算】移位操作实现乘法运算
    O(1)时间复杂度求栈中最小元素
    Java Socket UDP编程
  • 原文地址:https://www.cnblogs.com/xiongmao-cpp/p/6385926.html
Copyright © 2011-2022 走看看