UVA 10035 - Primary Arithmetic

最新推荐文章于 2024-01-20 19:49:44 发布

最新推荐文章于 2024-01-20 19:49:44 发布 · 245 阅读

本文介绍了一种算法，用于计算两个多位数相加时产生的进位次数，这对于评估数学教育中加法题目的难度非常有用。输入为两组不超过10位的非负整数，输出则是每组数相加时的进位操作次数。

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

Sample Output

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

#define RUN
#ifdef RUN

#include <stdio.h>
int main() {

#ifndef ONLINE_JUDGE
	freopen("10035.in", "r", stdin);
	freopen("10035.out", "w", stdout); 
#endif

  int a, b;
  while (scanf("%d%d",&a,&b) == 2){
    if (!a && !b) return 0;
	
    int c = 0, ans = 0;
	
    for (int i = 9; i >= 0; i--) {
      c = (a%10 + b%10 + c) > 9 ? 1 : 0;
      ans += c;
      a /= 10; b /= 10;
    }
	
    //printf("%d\n", ans);
	if(ans == 0){
		printf("No carry operation.\n");
	}
	else if(ans == 1){
		printf("%d carry operation.\n", ans);
	}
	else{
		printf("%d carry operations.\n", ans);
	}


  }
  return 0;
}
#endif