#include<stdio.h>
int main()
{
int m,n;
while(scanf("%d%d",&m,&n) && (m || n))
{
int count = 0;
int m1 = m%10;
int m2 = m/10%10;
int m3 = m/100;
int n1 = n%10;
int n2 = n/10%10;
int n3 = n/100;
if((m1 + n1) >= 10)
{
count++;
m2++;
}
if((m2 + n2) >= 10)
{
count++;
m3++;
}
if((m3 + n3) >= 10)
{
count++;
}
printf("%d\n",count);
}
return 0;
int main()
{
int m,n;
while(scanf("%d%d",&m,&n) && (m || n))
{
int count = 0;
int m1 = m%10;
int m2 = m/10%10;
int m3 = m/100;
int n1 = n%10;
int n2 = n/10%10;
int n3 = n/100;
if((m1 + n1) >= 10)
{
count++;
m2++;
}
if((m2 + n2) >= 10)
{
count++;
m3++;
}
if((m3 + n3) >= 10)
{
count++;
}
printf("%d\n",count);
}
return 0;
}
这个我花费了一段时间有点蠢,吸取教训,判断进位的时候还是按这种最笨的办法其实是最好的。