[Login|Register]
Problems

Status

Rank

Problem 1328
Product
Time Limit: 1000ms
Memory Limit: 65536kb
Description
The problem is to multiply two integers X, Y. (0<=X,Y<10^250)
Input
The input will consist of a set of pairs of lines. Each line in pair contains one multiplyer.
Output
For each input pair of lines the output line should consist one integer the product.
Sample Input
12
12
2
222222222222222222222222
Sample Output
144
444444444444444444444444
University of Science and Technology of China
Online Judge for ACM/ICPC
Processed in 1.3ms with 1 query(s).