源地址:http://www.patest.cn/contests/pat-a-practise/1001
注意下像 -999999或者999999这种例子,不要在符号后面或者最前面加个逗号就好了~
#include<stdio.h>
#include<iostream>
#include<string>
#include<string.h>
#include<algorithm>
#include<iomanip>
#include<vector>
#include<time.h>
#include<queue>
#include<stack>
#include<iterator>
#include<math.h>
#include<stdlib.h>
#include<limits.h>
#include<set>
#include<map>
//#define ONLINE_JUDGE
#define eps 1e-8
#define INF 0x7fffffff
#define FOR(i,a) for((i)=0;i<(a);(i)++)
#define MEM(a) (memset((a),0,sizeof(a)))
#define sfs(a) scanf("%s",a)
#define sf(a) scanf("%d",&a)
#define sfI(a) scanf("%I64d",&a)
#define pf(a) printf("%d\n",a)
#define pfI(a) printf("%I64d\n",a)
#define pfs(a) printf("%s\n",a)
#define sfd(a,b) scanf("%d%d",&a,&b)
#define sft(a,b,c)scanf("%d%d%d",&a,&b,&c)
#define for1(i,a,b) for(int i=(a);i<b;i++)
#define for2(i,a,b) for(int i=(a);i<=b;i++)
#define for3(i,a,b)for(int i=(b);i>=a;i--)
#define MEM1(a) memset(a,0,sizeof(a))
#define MEM2(a) memset(a,-1,sizeof(a))
const double PI=acos(-1.0);
template<class T> T gcd(T a,T b){return b?gcd(b,a%b):a;}
template<class T> T lcm(T a,T b){return a/gcd(a,b)*b;}
template<class T> inline T Min(T a,T b){return a<b?a:b;}
template<class T> inline T Max(T a,T b){return a>b?a:b;}
using namespace std;
#define ll __int64
int n,m;
#define Mod 1000000007
#define N 510
#define M 1000100
const int size = 46340+4;
const int mod = 9901;
char ch[M];
int key[30];
int main(){
int a,b;
char s[110];
while(scanf("%d%d",&a,&b)!=EOF){
int res = a+b;
sprintf(s,"%d",res);
int len = strlen(s);
int num=0;
vector<char>v;
for(int i=len-1;i>=0;i--){
v.push_back(s[i]);
num++;
if(num&&num%3==0){
if((i == 1 && s[i-1]=='-') || i==0) continue;
v.push_back(',');
}
}
int size = (int) v.size();
for(int i=size-1;i>=0;i--)
printf("%c",v[i]);
printf("\n");
// printf("%s\n",s);
}
return 0;
}