MUL - Fast Multiplication


Multiply the given numbers.

Input

n [the number of multiplications <= 1000]

l1 l2 [numbers to multiply (at most 10000 decimal digits each)]

Text grouped in [ ] does not appear in the input file.

Output

The results of multiplications.

Example

Input:
5
4 2
123 43
324 342
0 12
9999 12345

Output:
8
5289
110808
0
123437655

Warning: large Input/Output data, be careful with certain languages


hide comments
yugandhan: 2016-08-12 19:41:50

http://ideone.com/dlmHPF
in ideone it shows corect output... but in spoj it says wrong answer

Last edit: 2016-08-12 19:43:01
Rajat Sharma: 2016-08-02 15:07:39

whats the use of recursion here for java :(
Killed the purpose of recursion

Last edit: 2016-08-02 15:08:05
raj_4: 2016-07-31 06:05:32

please tell me what is segmentation fault

square1001: 2016-07-29 14:52:49

Let's solve Very Fast Multiplication(VFMUL). I got AC for C++, and my code got AC in VFMUL, too!
I think it is hard to solve VFMUL using Python or Ruby.

puneethnaik: 2016-07-13 03:58:17

realise the power of python !

mohitgupta07: 2016-05-12 18:10:46

nextLong() costed me one nzec..-_- thnx to bigInteger though :P

yashjain09: 2016-04-14 14:06:02

Working fine on my pc. Also gives the same output on ideone. But my spoj gives wrong answer. Please Help!

dhiptaraditya: 2016-03-19 02:13:50

is the input always positive or 0?

Last edit: 2016-03-19 02:17:01
vikash1143: 2016-03-09 05:44:42

i.e why i love python .3 lines

Mohit Rathore: 2016-01-22 07:20:18

Too easy in Python. Python should be removed from the list of permissible languages.


Added by:Darek Dereniowski
Date:2004-06-01
Time limit:1.649s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All
Resource:PAL