[USACO 2008 Feb B]Cow Multiplication
题号:NC24956
时间限制:C/C++/Rust/Pascal 1秒,其他语言2秒
空间限制:C/C++/Rust/Pascal 32 M,其他语言64 M
64bit IO Format: %lld

题目描述

Bessie is tired of multiplying pairs of numbers the usual way, so she invented her own style of multiplication. In her style, A*B is equal to the sum of all possible pairwise products between the digits of A and B. For example, the product 123*45 is equal to 1*4 + 1*5 + 2*4 + 2*5 + 3*4 + 3*5 = 54. Given two integers A and B (1 <= A, B <= 1,000,000,000), determine A*B in Bessie's style of multiplication.

输入描述:

* Line 1: Two space-separated integers: A and B.

输出描述:

* Line 1: A single line that is the A*B in Bessie's style of multiplication.
示例1

输入

复制
123 45

输出

复制
54