#10106Product
★★★時間限制：2000 毫秒記憶體限制：64 MB
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.
範例輸入 1
12 12 2 222222222222222222222222
範例輸出 1
144 444444444444444444444444
Pro 專屬功能： 查看這題在歷屆 CPE 出現過幾次 — 升級以解鎖.