zoukankan      html  css  js  c++  java
  • POJ 2562:Primary Arithmetic

    Primary Arithmetic
    Time Limit: 1000MS   Memory Limit: 65536K
    Total Submissions: 11135   Accepted: 4093

    Description

    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

    123 456
    555 555
    123 594
    0 0
    

    Sample Output

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

    Source

    Waterloo local 2000.09.23

    你  离  开  了  ,  我  的  世  界  里  只  剩  下  雨  。  。  。

    #include <cstdio>
    int main()
    {
        long int a, b;
        int carry, c;
        while (scanf("%ld%ld", &a, &b) , a + b)
        {
            carry = c = 0;
            while (a || b)
            {
                c = (a % 10 + b % 10 + c) > 9 ? 1 : 0;
                carry += c;
                a /= 10;
                b /= 10;
            }
            if (carry == 0)puts("No carry operation.");
            else if (carry == 1)puts("1 carry operation.");
            else printf("%d carry operations.
    ", carry);
        }
        return 0;
    }
    

  • 相关阅读:
    使用DataReader
    使用Dataset
    Command
    Ado.net对象
    集合数据源
    Label 表达式绑定
    输出二进制图像
    Application 可以存储全局变量
    字符串处理
    ?:叫条件运算符
  • 原文地址:https://www.cnblogs.com/im0qianqian/p/5989578.html
Copyright © 2011-2022 走看看