題目大意：計(jì)算兩個(gè)數(shù)相加時(shí)需要多少次進(jìn)位。
簡(jiǎn)單的高精度計(jì)算。
以下是我的代碼：
#include<stdio.h>
#include<string.h>
int main()
{
/*
freopen("data.in","r",stdin);
freopen("data.out","w",stdout);
//*/
const long maxn=17;
const char end[]="0";
char sa[maxn],sb[maxn];
while(scanf("%s%s",sa,sb)==2)
{
if(strcmp(sa,end)==0&&strcmp(sb,end)==0) break;
long lena=strlen(sa),lenb=strlen(sb),lenc,ans;
long a[maxn],b[maxn],c[maxn];
lenc=(lena>lenb?lena:lenb);
memset(a,0,sizeof(a));
memset(b,0,sizeof(b));
memset(c,0,sizeof(c));
for(long i=0;i<lena;i++) a[i]=sa[lena-i-1]-'0';
for(long i=0;i<lenb;i++) b[i]=sb[lenb-i-1]-'0';
ans=0;
for(long i=0;i<lenc;i++)
{
c[i]+=a[i]+b[i];
if(c[i]>=10)
{
c[i]-=10;
c[i+1]++;
ans++;
}
}
if(ans==0)
printf("No carry operation.\n");
else if(ans==1)
printf("1 carry operation.\n");
else printf("%ld carry operations.\n",ans);
}
return 0;
}