UVA 10035

Problem B: Primary Arithmetic

Children are taught to add multi-digit numbers from right-to-left onedigit at a time. Many find the "carry" operation - in which a 1 iscarried from one digit position to be added to the next - to bea significant challenge. Your job is to count the number of carry operations for each of a set of addition problems so thateducators 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 thatwould result from adding the two numbers, in the formatshown below.

Sample Input

123 456555 555123 5940 0

Sample Output

No carry operation.3 carry operations.1 carry operation.I did 6 - 7 WA on "operation" is no "operations" if n == 1
#include <iostream>#include <cstdio>using namespace std;int main(){    int a , b , ans;    while(cin >> a >> b , (a || b))    {        ans = 0;        int c = 0;        while(1)        {            if(a == 0&& b == 0)break;            c = (a % 10 + b % 10 + c) / 10;            ans += c;            a /= 10;            b /= 10;        }        if(ans == 0)printf("No carry operation.\n");        else if(ans == 1)printf("1 carry operation.\n");        else printf("%d carry operations.\n",ans);    }    return 0;}