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
I Made Krisna Widhiastra:
2014-05-13 18:20:42
(at most 10000 decimal digits each)
|
|
Manpreet Singh:
2014-05-13 18:20:42
my program in c++ produces efficient output but still called wrong answer |
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 |