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 9Sample Output
-999,991
备注: 考察大数的加减法,注意用字符串表示数字
#include<stdio.h> #include<stdlib.h> #include<string.h> void handle(char s[],char t[]) { int i,j; for(i = 1,j=0; s[i]!='\0';i++,j++) { t[j]=s[i]; } t[j]='\0'; } void reverse(char s[]) { int i; int len = strlen(s); char c; for(i = 0; i < len/2; i++) { c = s[i]; s[i] = s[len-1-i]; s[len-1-i] = c; } } void add(char s1[],char s2[],char result[]) { int len1,len2,i,j,k,m,rlen; int jinwei,sum; len1 = strlen(s1); len2 = strlen(s2); rlen = (len1>len2)?len1:len2; jinwei = 0; k = 0; //result[0]='\0'; if((s1[0]!='-' && s2[0]!='-') || (s1[0]=='-' && s2[0]=='-')) { for(i=len1-1,j=len2-1; i>=0 && j>=0; i--,j--) { sum = s1[i]+s2[j]-'0'*2+jinwei; if(sum>=10) { //sprintf(jw,"%d",sum); result[k++]=sum%10+'0'; jinwei = sum/10; } else { result[k++] = sum+'0'; jinwei = 0; } } /*剩余的照抄*/ if(len1>len2) { for(m=i;m>=0;m--) { sum = s1[m]-'0'+jinwei; if(sum>=10) { result[k++]=sum%10+'0'; jinwei = sum/10; } else { result[k++] = sum+'0'; jinwei = 0; } } if(jinwei>0) result[k++]=jinwei+'0'; } else if(len1<len2) { for(m=j;m>=0;m--) { sum = s2[m]-'0'+jinwei; if(sum>=10) { result[k++]=sum%10+'0'; jinwei = sum/10; } else { result[k++] = sum+'0'; jinwei = 0; } } if(jinwei>0) result[k++]=jinwei+'0'; } else { if(jinwei>0) result[k++]=jinwei+'0'; } result[k]='\0'; } } /* 默认s1为被减数*/ void substract(char s1[],char s2[],char result[]) { int len1,len2,i,j,k,m; int diff,jiewei; len1 = strlen(s1); len2 = strlen(s2); k=0; jiewei=0; for(i=len1-1,j=len2-1;i>=0 && j>=0;i--,j--) { diff = s1[i]-s2[j]+jiewei; if(diff<0) { result[k++]=diff+10+'0'; jiewei = -1; } else { result[k++]=diff+'0'; jiewei = 0; } } /*s1剩余处理*/ for(m=i;m>=0;m--) { diff = s1[m]-'0'+jiewei; if(diff<0) { result[k++]=diff+10+'0'; jiewei = -1; } else { result[k++]=diff+'0'; jiewei = 0; } } result[k]='\0'; for(m=strlen(result)-1;m>=0;m--) { if(result[m]!='0') break; } result[m+1]='\0'; } /*比较两个位数相同的数的大小*/ int compare(char s1[],char s2[]) { int i; for(i=0;s1[i]!='\0';i++) { if(s1[i]>s2[i]) return 1; else if(s1[i]<s2[i]) return -1; else continue; } return 0; } void output(char s[]) { int len = strlen(s); int i,k; int num_commas = len/3; if(len%3==0) num_commas--; if(len<=3) printf("%s",s); else { for(k=0;k<len;k++) { printf("%c",s[k]); if(num_commas>0) { if(k==len-1-num_commas*3) { printf(","); num_commas--; } } } } } int main() { char s1[20],s2[20],result[20],t1[20],t2[20]; int cmp; scanf("%s %s",s1,s2); if((s1[0]!='-' && s2[0]!='-')) { add(s1,s2,result); } else if(s1[0]=='-' && s2[0]=='-') { handle(s1,t1); handle(s2,t2); add(t1,t2,result); printf("-"); } else { if(s1[0]=='-') { handle(s1,t1); if(strlen(t1)>strlen(s2)) { substract(t1,s2,result); printf("-"); } else if(strlen(t1)<strlen(s2)) substract(s2,t1,result); else { cmp = compare(t1,s2); if(cmp==0) { printf("0"); exit(0); } else if(cmp>0) { substract(t1,s2,result); printf("-"); } else substract(s2,t1,result); } } else if(s2[0]=='-') { handle(s2,t2); if(strlen(s1)>strlen(t2)) substract(s1,t2,result); else if(strlen(s1)<strlen(t2)) { substract(t2,s1,result); printf("-"); } else { cmp = compare(s1,t2); if(cmp==0) { printf("0"); exit(0); } else if(cmp>0) substract(s1,t2,result); else { substract(t2,s1,result); printf("-"); } } } } reverse(result); output(result); return 0; }