zoukankan      html  css  js  c++  java
  • PAT 1001 A+B Format 使用地址传参的方式

    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,b106​​. 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<cstdio>
    #include<cmath>
    #include<stack>
    using namespace std;
    int  bit(int *sum)
    {
        
        int n=*sum%10;
        *sum=*sum/10;
        //printf("%d
    ",n);
        //printf("%d
    ",*sum);
        return n;
    }
    stack<int> s;
    int main()
    {
        int a,b,sum;
        while(scanf("%d %d",&a,&b)!=EOF)
        {
            int flag=0;
            sum=a+b;
            if(sum<0)
                flag=0;
            else
                flag=1;
            int i=0;
            int j=1;
            sum=abs(sum);
            //printf("%d
    ",sum);
            while(sum>9)
            {
                s.push(bit(&sum));
                j=j+1;
            }
            s.push(sum);
            if(flag==0)
            printf("-");
            while(!s.empty())
            {
              i=i+1;
              int k=s.top();
              s.pop();
              printf("%d",k);
              if(s.empty())
              break;
              if((j-i)%3==0)
              printf(",");
            }
            printf("
    ");
        }
        return 0;
     } 


    如果你够坚强够勇敢,你就能驾驭他们
  • 相关阅读:
    springcloud之zuul
    rabbitmq工作模式(三)Topics通配符模式
    rabbitMQ工作模式(二)路由模式
    rabbitmq工作模式(一)发布订阅模式
    Eureka使用案例
    SpringCloud入门
    微服务
    F查询和Q查询,摘自李文周老师
    django08 orm之增删改查
    django07 字符串替换
  • 原文地址:https://www.cnblogs.com/liuzhaojun/p/11125082.html
Copyright © 2011-2022 走看看