提示: 欢迎访问OurACM平台。
Problem 1453 Bignum Arithmetic

Accept: 511    Submit: 1370
Time Limit: 1000 mSec    Memory Limit : 32768 KB

Problem Description

In this problem, you will be concerned with integers with very large numbers of digits. You must write code which will repeatedly accept (until end of file) two lines each containing an unsigned integer, and output the product of the two input unsigned integers. The output must not contain any leading zeros.

You can assume that each integer will contain at most 80 digits. The input ends with an end of file.

Sample Input

0342 1298 12 3

Sample Output

443916 36

Source

MIT Programming Contest 2003 PRA

Submit  Back  Status  Discuss