本文主要是介绍题记(20)--Primary Arithmetic，希望对大家解决编程问题提供一定的参考价值，需要的开发者们随着小编来一起学习吧！
目录
一、题目内容
二、输入描述
三、输出描述
四、输入输出示例
五、完整C语言代码
一、题目内容
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.
四、输入输出示例
输入：
123 456 555 555 123 594 0 0输出：
NO carry operation. 3 carry operations. 1 carry operation.
五、完整C语言代码
AC代码~#include<stdio.h>
int main() {int a[10];int b[10];int x, y;while (scanf("%d%d", &x, &y) != EOF) {if (x == 0 && y == 0)break;int time = 0;int i = 0, j = 0;while (x != 0) {a[i++] = x % 10;x /= 10;}while (y != 0) {b[j++] = y % 10;y /= 10;}int carry = 0;int min_len = i > j ? j : i;for (int k = 0; k < min_len - 1; k++) {int tmp = a[k] + b[k] + carry;if (tmp >= 10) {time++;carry = tmp / 10;} elsecarry = 0;}int tmp = a[min_len - 1] + b[min_len - 1] + carry;if (tmp >= 10)time++;if (time == 0)printf("NO carry operation.\n");else if (time == 1)printf("1 carry operation.\n");elseprintf("%d carry operations.\n", time);}return 0;
}这篇关于题记(20)--Primary Arithmetic的文章就介绍到这儿，希望我们推荐的文章对编程师们有所帮助！
