// source code of submission 757941, Zhongshan University Online Judge System #include <iostream> #include <cstring> #include <cstdio> #include <malloc.h> void add(char a[],char b[],char back[]) { int i,j,k,up,x,y,z,l; char *c; if (strlen(a)>strlen(b)) l=strlen(a)+2; else l=strlen(b)+2; c=(char *)malloc(l*sizeof(char)); i=strlen(a)-1; j=strlen(b)-1; k=0;up=0; while(i>=0||j>=0) { if(i<0) x='0'; else x=a[i]; if(j<0) y='0'; else y=b[j]; z=x-'0'+y-'0'; if(up) z+=1; if(z>1) { up=1;z%=2; } else up=0; c[k++]=z+'0'; i--;j--; } if(up) c[k++]='1'; i=0; c[k]='/0'; for(k-=1;k>=0;k--) //这里要把开头的0忽略掉 { if(c[k]!='0') break; } if(k==-1) //这里考虑的是类似000+000的情况 { back[i] = '0'; back[1] = '/0'; } else { for(;k>=0;k--) back[i++]=c[k]; back[i]='/0'; } } int main() { char a[100],b[100],sum[100]; int n,Case = 1; scanf("%d",&n); while(n--) { scanf("%s %s",a,b); add(a,b,sum); printf("%d %s/n",Case,sum); Case++; } return 0; }