九度OJ 题目1143:Primary Arithmetic

该博客介绍了一个教育问题,涉及计算多位数相加时的进位操作次数,以评估教学难度。博主提供了输入输出示例,并对题目进行了分析,即将进行长整数加法的模拟以计算进位次数。
摘要由CSDN通过智能技术生成


一.题目描述:
    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.
样例输入:

123 456
555 555
123 594
0 0
样例输出:

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

二.题目分析

    模拟长整数加法变形

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值