PAT A A+B Format

yaoyuan-yy

于 2019-05-22 22:42:54 发布

阅读量313

点赞数

CC 4.0 BY-SA版权

本文链接：https://blog.youkuaiyun.com/YYecust/article/details/54766893

博客围绕PAT A 1001题目展开，题目要求输入A和B，格式化输出A+B，从后往前每三位打一个逗号。算法是先算出A+B的结果C，用sprintf将结果存入字符串s，再从后往前给s加逗号后输出。

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

PAT A 1001

https://www.patest.cn/contests/pat-a-practise/1001
#Description
输入A，B
格式化输出A+B
从后往前，三个打一个逗号
#Algorithm
算出A+B=C
然后sprintf到s
对s从后往前加逗号
然后输出
#Code

#define LOG(x) cout << #x << " = " << (x) << endl
#define PRINTLN(x) cout << (x) << endl
#define MEM(x, y) memset((x), (y), sizeof((x)))
#include <bits/stdc++.h>
using namespace std;
const double PI = 2*acos(0);
typedef long long ll;
typedef complex<double> Complex;
int nextInt()
{
  int x;
  scanf("%d", &x);
  return x;
}
ll nextLL()
{
  ll x;
  scanf("%lld", &x);
  return x;
}
//TEMPLATE

//MAIN
int main()
{
  //freopen("in.txt", "r", stdin);
  int a = nextInt(), b = nextInt();
  int c = a + b;
  char s[1000];
  sprintf(s, "%d", c);
  vector<char> v;
  int j = 0;
  for (int i = strlen(s) - 1; i >= 0; i--) {
    v.push_back(s[i]);
    j++;
    if (j == 3 && s[i - 1] != '-' && i > 0) {
      v.push_back(',');
      j = 0;
    }
  }
  while (!v.empty()) {
    cout << v.back();
    v.pop_back();
  }
  cout << endl;
}