POJ 2562:Primary Arithmetic

POJ 2562:Primary Arithmetic

Primary Arithmetic

Description

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.

Input

Each line of input contains two unsigned integers less than 10 digits. The last line of input contains 0 0.

Output

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.

Sample Input

123 456 555 555 123 594 0 0

Sample Output

No carry operation. 3 carry operations. 1 carry operation.

Source

​​Waterloo local 2000.09.23​​

你  离  开  了  ，  我  的  世  界  里  只  剩  下  雨  。  。  。

#include int main(){ long int a, b; int carry, c; while (scanf("%ld%ld", &a, &b) , a + b) { carry = c = 0; while (a || b) { c = (a % 10 + b % 10 + c) > 9 ? 1 : 0; carry += c; a /= 10; b /= 10; } if (carry == 0)puts("No carry operation."); else if (carry == 1)puts("1 carry operation."); else printf("%d carry operations.\n", carry); } return 0;}

版权声明：本文内容由网络用户投稿，版权归原作者所有，本站不拥有其著作权，亦不承担相应法律责任。如果您发现本站中有涉嫌抄袭或描述失实的内容，请联系我们jiasou666@gmail.com 处理，核实后本网站将在24小时内删除侵权内容。