当前你的浏览器版本过低,网站已在兼容模式下运行,兼容模式仅提供最小功能支持,网站样式可能显示不正常。
请尽快升级浏览器以体验网站在线编辑、在线运行等功能。

建议使用的浏览器:

谷歌Chrome 火狐Firefox Opera浏览器 微软Edge浏览器 QQ浏览器 360浏览器 傲游浏览器

2562: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.
输入样例
123 456
555 555
123 594
0 0
输出样例
No carry operation.
3 carry operations.
1 carry operation.

该题目是Virtual Judge题目,来自 北京大学POJ

源链接: POJ-2562

最后修改于 2020-10-29T06:35:55+00:00 由爬虫自动更新

共提交 0

通过率 --%
时间上限 内存上限
1000 65536