1799: Problem C: Primary Arithmetic
Time Limit: 1 Sec Memory Limit: 128 MB
Submit: 153 Solved: 49
[Submit][Status][Web Board]
Description
Problem C: Primary Arithmetic
Children are taught to add multi-digit numbers from right-to-left one digit at a time. Many find the “carry” operation - in which a 1 is carried from one digit position to be added to the next - to be a significant challenge. Your job is to count the number of carry operations for each of a set of addition problems so that educators may assess their difficulty.
Each line of input contains two unsigned integers less than 10 digits. The last line of input contains 0 0. For each line of input except the last you should compute and print the number of carry operations that would result from adding the two numbers, in the format shown below.
Input
Output
Sample Input
123 456
555 555
123 594
0 0
Sample Output
No carry operation.
3 carry operations.
1 carry operation.
HINT
Source
/*
注意进位只有一次的时候是打印“operation”,而不是“operations”!
*/
Ac_code:
#include <stdio.h>
#include <string.h>
#include <algorithm>
using namespace std;
char a[15],b[15],c[30];
int main()
{
while(~scanf("%s %s",a,b))
{
if(a[0]=='0'&&b[0]=='0') break;
int lenth_a = strlen(a);
int lenth_b = strlen(b);
int def,flag = 0;
memset(c,'\0',sizeof(c));
if(lenth_a > lenth_b)
{
flag = 1;
def = lenth_a - lenth_b;
fill(c,c+def,'0');
strcat(c,b);
}
else
{
def = lenth_b - lenth_a;
fill(c,c+def,'0');
strcat(c,a);
}
int carrybit = 0,x,y,time = 0,num;
for(int i = max(lenth_a,lenth_b); i >= 0; i--)
{
if(flag)
x = a[i] - '0';
else
x = b[i] - '0';
y = c[i] - '0';
num = x + y + carrybit;
if(num >= 10)
{
carrybit = num/10;
time++;
}
else
carrybit = 0;
}
if(time)
{
if(time > 1)
printf("%d carry operations.\n",time);
else
printf("%d carry operation.\n",time);
}
else
printf("No carry operation.\n");
memset(a,'0',sizeof(a));
memset(b,'0',sizeof(b));
}
return 0;
}