• <ins id="pjuwb"></ins>
    <blockquote id="pjuwb"><pre id="pjuwb"></pre></blockquote>
    <noscript id="pjuwb"></noscript>
          <sup id="pjuwb"><pre id="pjuwb"></pre></sup>
            <dd id="pjuwb"></dd>
            <abbr id="pjuwb"></abbr>

            coreBugZJ

            此 blog 已棄。

            ARITH - SPOJ 6. Simple Arithmetics

            One part of the new WAP portal is also a calculator computing expressions with very long numbers. To make the output look better, the result is formated the same way as is it usually used with manual calculations.

            Your task is to write the core part of this calculator. Given two numbers and the requested operation, you are to compute the result and print it in the form specified below. With addition and subtraction, the numbers are written below each other. Multiplication is a little bit more complex: first of all, we make a partial result for every digit of one of the numbers, and then sum the results together.

            Input

            There is a single positive integer T on the first line of input (equal to about 1000). It stands for the number of expressions to follow. Each expression consists of a single line containing a positive integer number, an operator (one of +, - and *) and the second positive integer number. Every number has at most 500 digits. There are no spaces on the line. If the operation is subtraction, the second number is always lower than the first one. No number will begin with zero.

            Output

            For each expression, print two lines with two given numbers, the second number below the first one, last digits (representing unities) must be aligned in the same column. Put the operator right in front of the first digit of the second number. After the second number, there must be a horizontal line made of dashes (-).

            For each addition or subtraction, put the result right below the horizontal line, with last digit aligned to the last digit of both operands.

            For each multiplication, multiply the first number by each digit of the second number. Put the partial results one below the other, starting with the product of the last digit of the second number. Each partial result should be aligned with the corresponding digit. That means the last digit of the partial product must be in the same column as the digit of the second number. No product may begin with any additional zeros. If a particular digit is zero, the product has exactly one digit -- zero. If the second number has more than one digit, print another horizontal line under the partial results, and then print the sum of them.

            There must be minimal number of spaces on the beginning of lines, with respect to other constraints. The horizontal line is always as long as necessary to reach the left and right end of both numbers (and operators) directly below and above it. That means it begins in the same column where the leftmost digit or operator of that two lines (one below and one above) is. It ends in the column where is the rightmost digit of that two numbers. The line can be neither longer nor shorter than specified.

            Print one blank line after each test case, including the last one.

            Example

            Sample Input:

            4
            12345+67890
            324-111
            325*4405
            1234*4
            
            

            Sample Output:

             12345
            +67890
            ------
             80235
            
             324
            -111
            ----
             213
            
                325
              *4405
              -----
               1625
                 0
             1300
            1300
            -------
            1431625
            
            1234
              *4
            ----
            4936
            
            Warning: large Input/Output data, be careful with certain languages.


            模擬題,LISP SBCL
             1(defun out-line(spa str &optional (ope nil))
             2 (dotimes (i spa)
             3  (write-char #\Space))
             4 (if ope (write-char ope))
             5 (write-string str)
             6 (fresh-line))
             7
             8
             9(defun out-dash(len-o len-y len-z)
            10 (dotimes (i (- len-o (max len-y len-z)))
            11  (write-char #\Space))
            12 (dotimes (i (max len-y len-z))
            13  (write-char #\-))
            14 (fresh-line))
            15
            16
            17(defun proc-plus-minus(str-x str-y plus)
            18 (let* ((num-x (parse-integer str-x))
            19        (num-y (parse-integer str-y))
            20        (num-z (if plus (+ num-x num-y) (- num-x num-y)))
            21        (str-z (write-to-string num-z))
            22        (len-x (length str-x))
            23        (len-y (1+ (length str-y)))
            24        (len-z (length str-z))
            25        (len-o (max len-x len-y len-z)))
            26  (out-line (- len-o len-x) str-x)
            27  (out-line (- len-o len-y) str-y (if plus #\+ #\-))
            28  (out-dash len-o len-y len-z)
            29  (out-line (- len-o len-z) str-z)))
            30
            31
            32(defun proc-mul(str-x str-y)
            33 (let* ((num-x (parse-integer str-x))
            34        (num-y (parse-integer str-y))
            35        (num-z (* num-x num-y))
            36        (str-z (write-to-string num-z))
            37        (len-x (length str-x))
            38        (len-y (length str-y))
            39        (len-z (length str-z))
            40        (len-o (max len-x (1+ len-y) len-z))
            41        (tmp-s nil)
            42        (len-s nil)
            43        (tmp-z (make-array len-y :fill-pointer 0))
            44        (dig-y (make-array len-y :initial-element #\0 :element-type 'character)))
            45  (dotimes (i len-y)
            46   (let ((j (1- (- len-y i))))
            47    (setf (elt dig-y j) (elt str-y j))
            48    (setf tmp-s (write-to-string (* num-x (parse-integer dig-y))))
            49    (setf (elt dig-y j) #\0)
            50    (when (string= tmp-"0")
            51     (setf tmp-s (make-array (1+ i) :initial-element #\0 :element-type 'character)))
            52    (setf len-s (length tmp-s))
            53    (setf len-o (max len-o len-s))
            54    (vector-push tmp-s tmp-z)))
            55  (out-line (- len-o len-x) str-x)
            56  (out-line (1- (- len-o len-y)) str-y #\*)
            57  (out-dash len-o (1+ len-y) (length (elt tmp-0)))
            58  (dotimes (i len-y)
            59   (setf tmp-s (elt tmp-z i))
            60   (setf len-s (length tmp-s))
            61   (out-line (- len-o len-s) (subseq tmp-0 (- len-s i))))
            62  (setf tmp-s (elt tmp-z (1- len-y)))
            63  (when (or (string/= tmp-s str-z) (/= len-1))
            64   (out-dash len-o (length tmp-s) len-z)
            65   (out-line (- len-o len-z) str-z))))
            66
            67
            68(dotimes (i (read))
            69 (let ((str (read-line))
            70       (idx nil))
            71  (cond
            72   ((find #\+ str)
            73    (setf idx (position #\+ str))
            74    (proc-plus-minus (subseq str 0 idx) (subseq str (1+ idx)) t))
            75   ((find #\- str)
            76    (setf idx (position #\- str))
            77    (proc-plus-minus (subseq str 0 idx) (subseq str (1+ idx)) nil))
            78   (t
            79    (setf idx (position #\* str))
            80    (proc-mul (subseq str 0 idx) (subseq str (1+ idx)))))
            81  (terpri)))
            82
            83

            posted on 2012-02-20 17:33 coreBugZJ 閱讀(492) 評(píng)論(0)  編輯 收藏 引用 所屬分類: ACMLisp

            热综合一本伊人久久精品| 久久久久久无码国产精品中文字幕 | 久久天天躁狠狠躁夜夜2020一| 久久无码AV中文出轨人妻| 久久毛片一区二区| 亚洲中文精品久久久久久不卡| 99久久无色码中文字幕| 久久一区二区三区99| 热re99久久精品国99热| 国产巨作麻豆欧美亚洲综合久久| 免费精品久久天干天干| 久久99热这里只有精品国产| 亚洲AV无码久久寂寞少妇| 久久亚洲高清综合| WWW婷婷AV久久久影片| 中文精品99久久国产| 99久久精品国产综合一区| 亚洲精品无码久久千人斩| 青青热久久国产久精品| 精品久久香蕉国产线看观看亚洲 | 国产精品久久久久久福利69堂| 91精品无码久久久久久五月天| 久久综合亚洲鲁鲁五月天| 久久久久久亚洲精品无码| 久久99中文字幕久久| 久久精品国产亚洲AV大全| 中文字幕精品无码久久久久久3D日动漫 | 亚洲欧美日韩久久精品| 久久午夜电影网| 国产成人精品久久一区二区三区| 伊人久久大香线焦AV综合影院 | 久久国产精品成人影院| 国产一区二区三区久久| 欧美亚洲另类久久综合婷婷| 精品国产青草久久久久福利| 国产精品欧美久久久久无广告| 色综合久久综合中文综合网| 欧美午夜精品久久久久免费视| 婷婷伊人久久大香线蕉AV| 亚洲精品国精品久久99热一| 人妻无码αv中文字幕久久琪琪布|