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
ayushranjan26:
20200829 19:57:02
where can i find the solution to this question


sohelr360:
20200720 12:01:45
In python it is really easy. but in c++ it is little bit complicated. 

ummihopes:
20200720 07:30:13
What does this statement actually mean? "Text grouped in [] does not appear in input file" 

raj_304590:
20200616 06:08:21
i used boost library .why it showing wrong answer? can anyone plz tell me. 

sk7175:
20200603 22:36:33
runtime error in C progtamming segmentation fault? 

wowthecoder:
20200517 06:56:54
For Java users, remember to use BufferedReader and StringTokenizer instead of Scanner because Scanner is too slow. Scanner gave me TLE while BufferedReader is accepted :) 

mill_2611:
20200511 19:18:17
C++ use boost library . Refer below


leverimmy:
20200504 08:52:56
You can use Karatsuba Multiplication for solving this problem. It will be O(n^1.585). 

achipu_1672:
20200229 17:45:12
whoever trying to solve this problem, don't use boost library in c++, or Biginteger in java or python here. please learn from the questions and your approaches. don't search for any shortcuts. you won't learn anything if you do. 

dejvik:
20200216 22:26:07
what can i do to lower my time limit in c++

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