首页 > 试题广场 >

Primary Arithmetic

[编程题]Primary Arithmetic

热度指数：2867 时间限制：C/C++ 1秒，其他语言2秒空间限制：C/C++ 64M，其他语言128M
算法知识视频讲解

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.

输出描述:

    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.

示例1

输入

输出

NO carry operation.
3 carry operations.
1 carry operation.

算法知识视频讲解

Python

TimeMac

while True:
    try:
        a,b = input().split()
        if len(a) > len(b):
            a,b = b,a        #保证a是比较短的
        carry = count = 0
        while a:             #每次相加最后一位和进位，并在循环结尾去掉最后一位
            if int(a[-1]) + int(b[-1]) + carry >= 10:
                carry = 1
                count += 1
            else:
                carry = 0
            a = a[:-1]                      
            b = b[:-1] 
        while b:                    
            if int(b[-1]) + carry >= 10:
                carry = 1
                count += 1
            else:
                carry = 0
            b = b[:-1]
        if count == 0:
            print("NO carry operation.")        
        elif count == 1:
            print("1 carry operation.")    #注意输出细节
        else:
            print('%d carry operations.' % count)
    except Exception:
        break

编辑于 2018-10-01 22:20:08 回复(0)