Question

hdu 1002 自己测试通过 就是老是wa 不知道哪里错了 求大牛

#include<stdio.h>
#include<string.h>
const int MAX=1005;
char s1[MAX],s2[MAX];
int a[MAX]={0};
int b[MAX]={0};
int c[MAX]={0};
int i,ce,q,len1,len2;
int main()
{
ce=0;
int n;
scanf("%d",&n);
while(n--)
{
q=0;
scanf("%s%s",s1,s2);
char *p1=s1;
char *p2=s2;
while(*p1=='0')
{
p1++;
q++;
}
for(i=q;i<strlen(s1);i++)
{
s1[i-q]=s1[i];//倒叙转成数字放入数组，从而实现不同长度的数从个位对齐
}
s1[i-q]='\0';
q=0;
while(*p2=='0')
{
p2++;
q++;
}
for(i=q;i<strlen(s2);i++)
{
s2[i-q]=s2[i];
}
s2[i-q]='\0';
len1=strlen(s1);
len2=strlen(s2);
q=len1;
while(q--)
{
a[q]=s1[len1-q-1]-'0';
}
q=len2;
while(q--)
{
b[q]=s2[len2-q-1]-'0';
}
if(len1>=len2)
q=len1;
else
q=len2;
for(i=0;i<q;i++)
{
if(a[i]+b[i]>=10)
{
c[i]+=(a[i]+b[i])%10;
c[i+1]+=(a[i]+b[i])/10;

}
else
{
c[i]+=a[i]+b[i];
}
}
ce++;
printf("Case %d:\n%s + %s = ",ce,s1,s2);
if(c[i]!=0)
printf("%d",c[i]);
while(i--)
printf("%d",c[i]);
printf("\n");
if(n)
printf("\n");
for(i=0;i<1005;i++)
{
a[i]=0;
b[i]=0;
c[i]=0;
}
}
return 0;

}

Answer 1

#include<stdio.h>
#include<string.h>
const int MAX=1005;
char s1[MAX],s2[MAX];
int a[MAX]={0};
int b[MAX]={0};
int c[MAX]={0};
int i,ce,q,len1,len2;
int main()
{
ce=0;
int n;
scanf("%d",&n);
while(n--)
{
q=0;
scanf("%s%s",s1,s2);
char *p1=s1;
char *p2=s2;
while(*p1=='0')
{
p1++;
q++;
}
for(i=q;i<strlen(s1);i++)
{
s1[i-q]=s1[i];//倒叙转成数字放入数组，从而实现不同长度的数从个位对齐
}
s1[i-q]='\0';
q=0;
while(*p2=='0')
{
p2++;
q++;
}
for(i=q;i<strlen(s2);i++)
{
s2[i-q]=s2[i];
}
s2[i-q]='\0';
len1=strlen(s1);
len2=strlen(s2);
q=len1;
while(q--)
{
a[q]=s1[len1-q-1]-'0';
}
q=len2;
while(q--)
{
b[q]=s2[len2-q-1]-'0';
}
if(len1>=len2)
q=len1;
else
q=len2;
for(i=0;i<q;i++)
{
if(a[i]+b[i]>=10)
{
c[i]+=(a[i]+b[i])%10;
c[i+1]+=(a[i]+b[i])/10;

}
else
{
c[i]+=a[i]+b[i];
}
c[i+1] += c[i]/10; // 做进位处理
c[i]%=10; // 做进位处理
}
ce++;
printf("Case %d:\n%s + %s = ",ce,s1,s2);
if(c[i]!=0)
printf("%d",c[i]);
while(i--)
printf("%d",c[i]);
printf("\n");
if(n)
printf("\n");
for(i=0;i<1005;i++)
{
a[i]=0;
b[i]=0;
c[i]=0;
}
}
return 0;

}